Anagram Checker

Two strings are considered anagrams if they contain exactly the same characters, regardless of the order, when spaces are removed and capitalization is ignored. Formally, given two strings \(S_1\) and \(S_2\), if we remove all spaces and convert all letters to lowercase, then they are anagrams if \(sorted(S_1) = sorted(S_2)\).

Your task is to write a program that reads two strings from standard input, determines whether they are anagrams of each other, and outputs the result.

inputFormat

The input consists of two lines. Each line contains one string that may include spaces and mixed capitalization.

outputFormat

Output a single line containing True if the two strings are anagrams of each other, otherwise output False.

binary
brainy

True