Anagram Checker

Given two input strings \(S_1\) and \(S_2\), determine if they are anagrams. Two strings are anagrams if, after removing all spaces, punctuation, and converting all letters to lowercase, the sorted sequences of characters are identical. In other words, if we let \(f(s)\) be the function that removes non-alphanumeric characters and converts to lowercase, then the two strings are anagrams if \(sorted(f(S_1)) = sorted(f(S_2))\).

Handle Unicode letters and digits properly. Print True if the strings are anagrams and False otherwise.

inputFormat

The input is read from standard input (stdin) and consists of exactly two lines. The first line contains the first string, and the second line contains the second string.

outputFormat

Output should be printed to standard output (stdout) as either True or False (without quotes) depending on whether the two strings are anagrams or not.

Listen
Silent

True