Anagram Checker

Problem Description:

Given two strings, determine if they are anagrams of each other. While checking, ignore any non-alphabetical characters and treat uppercase and lowercase letters as identical.

In other words, two strings are anagrams if after removing all non-letter characters and converting all letters to lowercase, both strings contain exactly the same letters with the same frequency. For example, "Astronomer" and "Moon starer" are anagrams.

Note: The input strings will be provided one per line. Your program should read from standard input and print the result to standard output.

inputFormat

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

outputFormat

Output a single line: "True" if the two strings are anagrams (ignoring case and non-alphabetical characters); otherwise, output "False".## sample

Astronomer
Moon starer

True