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 (3.4.3) (judge verdict: Accepted)

s = input()
t = input()
num_s ={}
num_t ={}
for i in range(len(s)):
    si = s[i]
    ti = t[i]
    if si in num_s:
        num_s[si] +=1
    else:
        num_s[si] =1
    if ti in num_t:
        num_t[ti] +=1
    else:
        num_t[ti] =1

values_s = list(num_s.values())
values_t = list(num_t.values())
values_s.sort()
values_t.sort()
if values_s==values_t:
    print('Yes')
else:
    print('No')