#K62362. Anagram Checker

    ID: 31515 Type: Default 1000ms 256MiB

Anagram Checker

Anagram Checker

Given two strings, determine if they are anagrams of each other.

Two strings are anagrams if they contain the same characters in the same frequencies, but possibly in a different order. For example, the strings "listen" and "silent" are anagrams, whereas "hello" and "billion" are not.

The solution should read input from stdin and output the result to stdout in the format specified below.

Note that the answer must be printed as exactly "True" if the strings are anagrams, or "False" otherwise.

inputFormat

The input consists of exactly two lines. The first line contains the first string and the second line contains the second string.

Both strings may contain any characters.

outputFormat

Output a single line with either "True" or "False" depending on whether the two input strings are anagrams of each other.

## sample
listen
silent
True