Anagram Checker

You are given two strings, s1 and s2. Your task is to determine whether the two strings are anagrams of each other. Two strings are anagrams if one string can be rearranged to form the other, meaning they both contain exactly the same characters with the same frequencies.

The solution should read from standard input (stdin) and write the result to standard output (stdout) as either "True" or "False". Use appropriate algorithms to ensure efficiency.

inputFormat

The input consists of two lines. The first line contains the first string s1, and the second line contains the second string s2.

Example:

carnation
contraina

outputFormat

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

Example:

True

carnation
contraina

True