Anagram Checker

Your task is to determine whether two given strings are anagrams of each other. Two strings are anagrams if one string can be rearranged to form the other, meaning both strings have exactly the same characters with the same frequency.

For example, the strings \(listen\) and \(silent\) are anagrams because when sorted they both result in \(eilnst\).

inputFormat

The input consists of two lines. The first line contains the first string and the second line contains the second string. Each string consists only of lowercase English letters.

outputFormat

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

listen
silent

True