Anagram Checker

The task is to determine whether two given strings are anagrams. Two strings are anagrams if one string can be rearranged to form the other, using every letter exactly once. The comparison should be case-insensitive and must ignore all non-alphanumeric characters such as spaces and punctuation. Formally, given two strings \( s_1 \) and \( s_2 \), after removing all characters except letters and numbers and converting them to the same case, the strings are anagrams if and only if their sorted sequences of characters are identical.

Your program should read the input from standard input (stdin) and output the result to standard output (stdout) as either "True" or "False".

inputFormat

Input consists of exactly two lines. The first line contains the first string \( s_1 \) and the second line contains the second string \( s_2 \).

outputFormat

Output a single line with either "True" if the two strings are anagrams under the described conditions, or "False" otherwise.

Astronomer
Moon starer

True