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 = list(input())
T = list(input())

dict1 = {}
for s in S:
  if(s in dict1): dict1[s] += 1
  else: dict1[s] = 1   
dict2 = {}
for t in T:
  if(t in dict2): dict2[t] += 1
  else: dict2[t] = 1

list1,list2 = [],[]
for k, v in sorted(dict1.items(), key=lambda x: x[1]):
  list1.append(v)
for k, v in sorted(dict2.items(), key=lambda x: x[1]):
  list2.append(v)

#結局,要素の種類と個数が一致していたらOK
if(list1 == list2):
 print('Yes')
else:
 print('No')