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)

# coding: utf-8
import string

s = input().split()
t = input().split()
s = list(s[0])
t = list(t[0])

alpha = list(string.ascii_lowercase)

cnt_s = []
cnt_t = []
for c in alpha:
    cnt_s = cnt_s + [0]
    cnt_t = cnt_t + [0]

cnt = 0
for c in alpha:
    for c_s in s:
        if c_s == c:
            cnt_s[cnt] = cnt_s[cnt] + 1
    for c_t in t:
        if c_t == c:
            cnt_t[cnt] = cnt_t[cnt] + 1
    cnt+=1

cnt = 0
flag = 0
for i in range(len(alpha)):
    if not( (cnt_s[i] == 0 and cnt_t[i] == 0) or cnt_s[i] == cnt_t[i]):
        flag = 1

if flag == 0:
    print("Yes")
else:
    print("No")