Are Anagrams?

Given two strings, determine if they are anagrams of each other. Two strings are anagrams if one string can be rearranged to form the other. The check is case-sensitive and considers all characters (including spaces and punctuation).

The input consists of two lines. The first line contains the first string, and the second line contains the second string. Output a single line: True if the strings are anagrams of each other, otherwise False.

Note: Even if the strings differ only in case or spacing, they are not considered anagrams.

inputFormat

The input is read from standard input and consists of two lines:

• The first line contains the first string.
• The second line contains the second string.

outputFormat

Output a single line to standard output, which is either True or False depending on whether the two strings are anagrams.

## sample

listen
listen

True

</p>