Anagram Checker

Given two strings, determine whether the first string is an anagram of the second string. Two strings are anagrams if they contain exactly the same characters with the same frequencies, though possibly in different orders. Mathematically, for two strings (s_1) and (s_2), they are anagrams if

[ \text{Counter}(s_1) = \text{Counter}(s_2) ]

Read the two input strings from standard input (each on a separate line) and print either "True" if they are anagrams, or "False" otherwise.

inputFormat

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

outputFormat

Output a single line with either "True" or "False", indicating whether s1 is an anagram of s2.## sample

listen
silent

True