LogiQuest

113. Isomorphic Strings

EasyHash Map

Two strings are isomorphic if characters of the first can be replaced consistently (one-to-one) to get the second. Print YES or NO.

Input format

Line 1: s Line 2: t

Output format

YES or NO

Example 1

Input

egg
add

Output

YES

Example 2

Input

foo
bar

Output

NO

Constraints

1 ≤ |s|, |t| ≤ 10⁵

Read input from standard input and print the answer to standard output. Your code is judged against 5 test cases, most of them hidden.

Loading the MyLoginn IDE…