Problem:
Score : 300 points

Problem Statement

You are given strings S and T consisting of lowercase English letters.

You can perform the following operation on S any number of times:

Operation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.

Determine if S and T can be made equal by performing the operation zero or more times.

Constraints

1 \leq |S| \leq 2 \times 10^5

|S| = |T|

S and T consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T

Output

If S and T can be made equal, print Yes; otherwise, print No.

Sample Input 1

azzel
apple

Sample Output 1

Yes

azzel can be changed to apple, as follows:

Choose e as c_1 and l as c_2. azzel becomes azzle.

Choose z as c_1 and p as c_2. azzle becomes apple.

Sample Input 2

chokudai
redcoder

Sample Output 2

No

No sequences of operation can change chokudai to redcoder.

Sample Input 3

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu

Sample Output 3

Yes

Solution in PyPy3 (7.3.0) (judge verdict: Accepted)

s=[ord(c) for c in input()]
t=[ord(c) for c in input()]
n=len(s)
st=[(s[i],t[i]) for i in range(n)]
st=sorted(st,key=lambda x:x[0])
s=[c for c,_ in st]
t=[c for _,c in st]

for i in range(n-1):
    if (s[i]==s[i+1]) ^ (t[i]==t[i+1]):
        print('No')
        exit(0)

st=sorted(st,key=lambda x:x[1])
s=[c for c,_ in st]
t=[c for _,c in st]

for i in range(n-1):
    if (s[i]==s[i+1]) ^ (t[i]==t[i+1]):
        print('No')
        exit(0)


print('Yes')