Anagram Checker

You are given two strings, \( s_1 \) and \( s_2 \). Your task is to determine whether these two strings are anagrams of each other. Two strings are anagrams if, after sorting the characters of each string, the resulting sequences are identical. In other words, the condition for being anagrams is:

\( sorted(s_1) = sorted(s_2) \)

Note that the comparison is case-sensitive and all characters (including special characters and punctuation) are considered. For instance, "silent" and "listen" are anagrams, while "Silent" and "Listen" are not.

inputFormat

The input consists of exactly two lines. The first line contains the first string ( s_1 ) and the second line contains the second string ( s_2 ).

outputFormat

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

silent
listen

True