Anagrams Checker

Given two strings s1 and s2, determine whether they are anagrams of each other. Two strings are anagrams if they contain exactly the same characters, though possibly in a different order. Formally, let \( S_1 \) and \( S_2 \) represent the sorted sequences of characters from the two strings, respectively. The strings are anagrams if and only if \( S_1 = S_2 \). This problem is case-sensitive.

inputFormat

The input is provided via standard input (stdin) and consists of exactly two lines. The first line contains the first string s1, and the second line contains the second string s2. Each string consists of alphabetic characters and may be empty.

outputFormat

Print to standard output (stdout) a single line containing either "True" or "False" depending on whether the two given strings are anagrams of each other.

cinema
iceman

True