Anagram Checker

Given two strings s1 and s2, determine whether they are anagrams of each other, ignoring case and spaces. Two strings are anagrams if the characters in one string can be rearranged to form the other string after removing all spaces and converting to lowercase.

For example, listen and silent are anagrams, and conversation and voices rant on are also anagrams.

Your task is to implement a function that reads two strings from stdin and prints True if they are anagrams, or False otherwise. All output should be written to stdout and any formulas should be represented in LaTeX format.

inputFormat

The input consists of two lines. The first line contains the string s1 and the second line contains the string s2. Spaces may appear within the strings and should be ignored. The strings may contain mixed case letters, digits, and special characters.

outputFormat

Output a single line: True if the processed strings are anagrams of each other, or False otherwise.

listen
silent

True