Anagram Checker

Given two strings, determine if they are anagrams of each other. An anagram is a rearrangement of all the letters of one string to form the other string. The comparison is case-insensitive.

For example, the strings "listen" and "silent" are anagrams, while "rat" and "car" are not.

Mathematically, if we define \( S_1 \) and \( S_2 \) as two sequences of characters (ignoring case), then they are anagrams if and only if \( sort(\text{lower}(S_1)) = sort(\text{lower}(S_2)) \).

inputFormat

The input consists of exactly two lines. The first line contains the first string and the second line contains the second string.

outputFormat

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

listen
silent

True