Valid Anagram

Problem statement

Two teams assemble letter tiles into labels. Decide whether both labels use exactly the same letters with exactly the same frequencies, regardless of ordering. Every lowercase letter is significant.

Input format

Two lines, one nonempty lowercase English string per line.

Output format

Print true or false in lowercase.

Constraints

1 <= each string length <= 100000.

Sample input

silent
listen

Sample output

true