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()
N = len(S)
C_S = dict()
C_T = dict()
count_s = 0
count_t = 0
s_list = []
t_list = []
for i in range(N):
    if S[i] in C_S:
        C_S[S[i]] += 1
    else:
        C_S[S[i]] = 1
        count_s += 1
for i in range(N):
    if T[i] in C_T:
        C_T[T[i]] += 1
    else:
        C_T[T[i]] = 1
        count_t += 1
check = True
for skey in C_S.keys():
    s_list.append(C_S[skey])
for tkey in C_T.keys():
    t_list.append(C_T[tkey])
s_list.sort()
t_list.sort()

if count_s == count_t:
    for i in range(len(s_list)):
        if s_list[i] != t_list[i]:
            check = False
else:
    check = False

if check:
    print('Yes')
else:
    print('No')