Anagram Checker

Given two strings S1 and S2, determine whether they are anagrams of each other. Two strings are anagrams if, after removing all non-alphanumeric characters and converting all letters to lowercase, their sorted sequences of characters are identical. In other words, if you define the cleaned version of a string as \(C(S)=\text{sorted}(\{\text{lowercase}(c) : c \in S \text{ and } c \text{ is alphanumeric}\})\), then the strings are anagrams if \(C(S1)=C(S2)\).

inputFormat

The input is given via standard input (stdin) and consists of two lines. The first line contains the string S1 and the second line contains the string S2. Each string may include spaces, punctuation, and alphanumeric characters.

outputFormat

Output to standard output (stdout) a single line with the string "True" if S1 and S2 are anagrams, or "False" otherwise.

listen
silent

True