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: Wrong Answer)

from collections import Counter
S=list(input())
T=list(input())
Tcnt=list(Counter(T).items())
# Tcnt2=[]
# for i in range(len(Tcnt)):
#     if Tcnt[i][1]>1:
#         Tcnt2.append(Tcnt[i][0])
# for i in range(len(Tcnt2)):
#     tmp=set([])
#     for j in range(len(S)):
#         if T[j]==Tcnt2[i]:
#             tmp.add(S[j])
#     if len(tmp)>1:
#         print('No')
#         exit()
# print('Yes')
A=set([])
for i in range(len(S)):
    if S[i]!=T[i]:
        A.add((min(S[i],T[i]),max(S[i],T[i])))
# print(A,len(A))
C=list(A)
B=[]
for i in range(len(C)):
    for j in range(2):
        B.append(C[i][j])
# print(B)
BX=list(set(list(Counter(B).values())))
# print(BX)
print('Yes' if len(BX)==1 else 'No')