Two strings s and t are isomorphic if there is a one-to-one mapping between their characters that turns s into t: every occurrence of a character in s must map to the same character in t, and no two distinct characters of s may map to the same character of t.
Decide whether s and t are isomorphic.
Input format
Line 1: the string s.
Line 2: the string t.
Output format
Print YES if s and t are isomorphic, otherwise NO.
Constraints
- 1 <= len(s), len(t) <= 100000
- Both strings consist of lowercase English letters.
- If the lengths differ the answer is
NO.