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`.

Examples

Input

azzel
apple


Output

Yes


Input

chokudai
redcoder


Output

No


Input

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu


Output

Yes
S = raw_input()
T = raw_input()

s_c_list = []
t_c_list = []

new_S = ""
new_T = ""

for i in range(len(S)):
    if not S[i] in s_c_list:
        new_S+=str(len(s_c_list))
        s_c_list.append(S[i])
    else:
        new_S+=str(s_c_list.index(S[i]))
    if not T[i] in t_c_list:
        new_T+=str(len(t_c_list))
        t_c_list.append(T[i])
    else:
        new_T+=str(t_c_list.index(T[i]))

if new_S==new_T:
    print "Yes"
else:
    print "No"