Anagram Checker

Given two strings, determine whether they are anagrams of each other. Two strings are anagrams if they contain the same characters in the same frequency. The comparison is case-sensitive (i.e. 'Listen' and 'Silent' are not considered anagrams) and the order of characters may differ.

Formally, for two strings \( s_1 \) and \( s_2 \), they are anagrams if \( |s_1| = |s_2| \) and the sorted sequence of characters of \( s_1 \) equals the sorted sequence of characters of \( s_2 \).

inputFormat

The input consists of two lines. The first line contains the string \( s_1 \) and the second line contains the string \( s_2 \). Both strings are non-empty and may contain spaces.

outputFormat

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

listen
silent

True