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)

s = str(input())
t = str(input())
sl = list(s)
tl = list(t)
list1 = [e for e in set(sl) if sl.count(e) > 1]
list2 = [e for e in set(tl) if tl.count(e) > 1]
count = 0
if len(sl) != len(tl) or len(list1) != len(list2):
  count = 1
else:
  check1 =[[j for j in range(len(sl)) if i == sl[j]] for i in list1]
  check2 =[[j for j in range(len(tl)) if i == tl[j]] for i in list2]
  if check1 == check2:
    count = 0
  else:
    count = 1
if count == 0:
  print("Yes")
else:
  print("No")