Anagram Checker

Given two strings, determine whether they are anagrams of each other.

An anagram of a string is another string that contains the same characters but in a different order. Formally, for two strings ( s ) and ( t ), they are anagrams if and only if for every character ( x ), the frequency of ( x ) in ( s ) is equal to the frequency of ( x ) in ( t ), i.e. ( f_s(x) = f_t(x) ).

inputFormat

The input consists of two lines. The first line contains the first string and the second line contains the second string.

outputFormat

Output a single line: 'True' if the two strings are anagrams of each other, or 'False' otherwise.## sample

abc
abc

True