Two keycard strings are isomorphic if the letters of the first can be consistently replaced to produce the second: every occurrence of a given letter in the first string must map to the same letter in the second string, no two distinct letters may map to the same letter, and the mapping must work in both directions. Strings of different lengths are never isomorphic.
Input format
Line 1: the first keycard string, of lowercase English letters. Line 2: the second keycard string, of lowercase English letters.
Output format
Print YES if the two strings are isomorphic, otherwise NO.
Constraints
- 1 <= length of each string <= 40
- Both strings consist only of lowercase English letters.