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
a=raw_input()
b=raw_input()

aa=list(a)
bb=list(b)

aa.sort()
bb.sort()

aaa=[]
ac=0
acw=aa[0]
for i in aa:
    if acw==i:
        ac+=1
    else:
        acw=i
        aaa.append(ac)
        ac=1
aaa.append(ac)

bbb=[]
bc=0
bcw=bb[0]
for i in bb:
    if bcw==i:
        bc+=1
    else:
        bcw=i
        bbb.append(bc)
        bc=1
bbb.append(bc)

aaa.sort()
bbb.sort()
ch=0
if len(aaa)==len(bbb):
    for i in range(len(aaa)):
        if aaa[i]!=bbb[i]:
            print "No"
            ch=1
            break
else:
    print "No"
    ch=1

if ch==0:
    print "Yes"