Recursive Anagram Check

C++ Medium recursion

Task «Recursive Anagram Check»

Given two strings. It is required to use recursion to check whether they are anagrams (i.e., contain the same characters in the same quantity, ignoring case). The solution must be recursive, without using loops or built-in sorting. The length of the strings does not exceed 100 characters.

Input Format

Two strings are given as input, each on a separate line.

Output Format

Output 'YES' if the strings are anagrams, otherwise 'NO'.

Examples

Example 1

INPUT

abc
abd

OUTPUT

NO

Example 2

INPUT

5
12 23 34 45 56

OUTPUT

NO

main.cpp