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)

w1 = input()
w2 = input()

s1 = list(w1)
s2 = list(w2)
s1.sort()
s2.sort()

c1 = 0
t1 = ""
a1 = []
for i1 in range(len(s1)):
    if s1[i1] != t1:
        a1.append(c1)
        t1 = s1[i1]
        c1 = 1
        if i1 == len(s1) - 1:
            a1.append(c1)
    else:
        c1 += 1
        if i1 == len(s1) - 1:
            a1.append(c1)

c1 = 0
t1 = ""
a2 = []
for i2 in range(len(s2)):
    if s2[i2] != t1:
        a2.append(c1)
        t1 = s2[i2]
        c1 = 1
        if i2 == len(s2) - 1:
            a2.append(c1)
    else:
        c1 += 1
        if i2 == len(s2) - 1:
            a2.append(c1)

a1.sort()
a2.sort()

if a1 == a2:
    print("Yes")
else:
    print("No")