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>
#include<algorithm>
using namespace std;
#define MAXN 2*100000+5
char s1[MAXN],s2[MAXN];
int a[30],b[30];
int main() {
	scanf("%s",s1),scanf("%s",s2);
	for(int i=0;s1[i];i++)
		a[s1[i]-'a']++;
	for(int i=0;s2[i];i++)
		b[s2[i]-'a']++;
	sort(a,a+30), sort(b,b+30);
	for(int i=0;i<30;i++)
		if(a[i]!=b[i]) {
			puts("No");
			return 0;
		}
	puts("Yes");
}