Anagram Checker

This problem requires you to determine whether two given strings are anagrams of each other. Two strings are considered anagrams if they contain the same characters in the same quantities, but possibly in a different order. In mathematical terms, if we let \(S_1\) and \(S_2\) be the multisets of characters from each string, then the two strings are anagrams if and only if \(S_1 = S_2\).

Your task is to write a program that reads two lines from standard input (each corresponding to a string) and prints "True" if they are anagrams and "False" otherwise. Note that the comparison is case-sensitive and that spaces and punctuation, if any, should be treated as characters.

inputFormat

The input consists of two lines. The first line contains the first string and the second line contains the second string. Both strings may consist of any printable characters and can be empty.

outputFormat

Output a single line containing either "True" if the two strings are anagrams, or "False" otherwise.

listen
silent

True