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

S.sort()
T.sort()
Sdata = []
Tdata = []

counter = 0
p = S[0]
for i in S:
    if i == p:
        counter += 1
    else:
        Sdata.append(counter)
        counter = 1
        p = i
Sdata.append(counter)

counter = 0
p = T[0]
for i in T:
    if i == p:
        counter += 1
    else:
        Tdata.append(counter)
        counter = 1
        p = i
Tdata.append(counter)

Sdata.sort()
Tdata.sort()

if Sdata == Tdata:
    print 'Yes'
else:
    print 'No'