Anagram Checker

You are given two strings. Your task is to determine whether these two strings are anagrams of each other.

Two strings s and t are anagrams if they contain the same characters with the same frequency. In mathematical terms, if we denote the frequency of a character c in a string s as \(f_s(c)\), then s and t are anagrams if:

\(\forall c, \; f_s(c) = f_t(c)\)

For example, "listen" and "silent" are anagrams because they both contain the same letters with the same frequencies.

inputFormat

The input consists of 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, and False otherwise.

listen
silent

True