Anagram Checker

Given two strings, determine whether they are anagrams of each other. Two strings are considered anagrams if they use the same characters in the same frequency, ignoring spaces and case.

In other words, let \( s_1 \) and \( s_2 \) be two strings. First, remove all spaces and convert all characters to lowercase. Then, \( s_1 \) is an anagram of \( s_2 \) if when both are sorted, they become identical.

For example, "Listen" and "Silent" are anagrams as both become "eilnst" after processing.

inputFormat

The input consists of two lines. Each line contains a non-empty 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, otherwise "False".

Listen
Silent

True