Two strings are anagrams if one can be rearranged into the other using every letter exactly once.
Input: two lines, each a lowercase string. Output: true or false.
true
false
Your program reads from stdin and prints to stdout.
Example 1
Input: anagram nagaram
Output: true
Hints