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
#include<cstdio>
#include<cstring>
char s[200050],t[200050];
bool vis[26];
int n;
inline void update(int k,char c1,char c2){
	for(int i=k;i<n;i++)if(t[i]==c1)t[i]=c2;
	else if(t[i]==c2)t[i]=c1;
}
int main(){
	scanf("%s%s",s,t);
	n=strlen(s);
	for(int i=0;i<n;i++){
		if(s[i]!=t[i])if(vis[s[i]-'a']||vis[t[i]-'a']){
			puts("No");
			return 0;
		}else update(i,s[i],t[i]);
		vis[s[i]-'a']=1;
	}
	puts("Yes");
	return 0;
}