Anagram Checker

Given two strings, determine whether they are anagrams of each other. Two strings are anagrams if they consist of the same characters (with the same frequency) after all spaces are removed. Note: The comparison is case-sensitive (i.e., uppercase and lowercase letters are considered different). In mathematical terms, let \(S_1\) and \(S_2\) be the two strings with all spaces removed. Then, the strings are anagrams if and only if \(\mathrm{sorted}(S_1)=\mathrm{sorted}(S_2)\).

inputFormat

The input consists of two lines. The first line contains the first string \(s_1\), and the second line contains the second string \(s_2\).

outputFormat

Output a single line with either True or False indicating whether the two strings are anagrams of each other after ignoring spaces.

listen
silent

True