Anagram Checker

Given two strings, determine whether they are anagrams of each other. Two strings are considered anagrams if, after ignoring case and non-alphabetic characters, the sorted sequence of letters in each string is identical.

For example, the strings "Listen" and "Silent" are anagrams, and so are "Anagram" and "Nag a Ram".

The condition can be formally expressed as: if \( A \) and \( B \) are the normalized versions of the two strings, then they are anagrams if \( sort(A) = sort(B) \).

inputFormat

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

outputFormat

Output a single line: True if the two strings are anagrams according to the above definition; otherwise, output False.

Listen
Silent

True