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 Python (2.7.6) (judge verdict: Runtime Error)

flag = True
egal = False
count = 0
S,T = raw_input().lower().split()
Ss = set(S)
Ts = set(T)
dset = Ss - Ts
dset2 = Ts - Ss
if len(dset) < 3 or len(dset2) < 3:
    flag = False
elif len(dset) == 0 or len(dset2) == 0:
    egal = True
else:
    c1, c2 = dset
    c3, c4 = dset2
    Sl = list(S)
    Tl = list(T)
    for s in S:
        if s == c1:
            S = S.replace(s, c3)
            count += 1
        if s == c2:
            S = S.replace(s, c4)
            count += 1
if S == T and count < 4 and flag:
    print('Yes')
if egal == True:
    print('Yes')
else:
    print('No')