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
from collections import Counter
S=raw_input()
T=raw_input()

start=[ -1 for i in range(26) ]
goal=[ -1 for i in range(26) ]

L=len(S)


for i in range(L):
	a=ord(S[i])-ord("a")
	b=ord(T[i])-ord("a")

	if start[a]!=-1 or goal[b]!=-1:
		if start[a]!=b or goal[b]!=a:
			print "No"
			quit()
	else:
		start[a]=b
		goal[b]=a

#print "start::: ",start
#print "goal::: ",goal

print "Yes"