Check if Two Strings Are Anagrams

Given two strings, determine whether they are anagrams of each other. Two strings are anagrams if one string can be rearranged to form the other. Formally, if you sort both strings, they should be identical, i.e., $$sorted(S_1) = sorted(S_2)$$.

Your task is to write a program that reads two strings from standard input and prints True if they are anagrams, and False otherwise.

inputFormat

The input consists of two lines. The first line contains the first string and the second line contains the second string. Extra spaces at the beginning or end of each line should be ignored.

outputFormat

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

listen
silent

True