Pre-requisites: Anagrams are defined as words or names that can be formed by rearranging letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams.

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'

Now, Coding Ninjas has the following task for you:

You would be given two strings. You have to tell whether these strings form an anagram pair or not. The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Note:

Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 

Input format:

The first and the only line of input contains two single space-separated strings Str1 and Str2, respectively.

Remember/Consider:

Neither of the two input strings contains spaces in between, except to differentiate one from the other.

Also, both the strings will be in lowercase characters.

Output format:

The only line of output contains either True or False. True, if the given two strings form an anagram pair and False otherwise.

You don't have to explicitly print by yourself. It has already been taken care of.   

Constraints:

1 <= N <= 10^5 
1 <= M <= 10^5
Where N and M are the lengths of the strings str1 and str2 , respectively.

Time Limit: 1sec