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 <bits/stdc++.h>
#define MAXN 200010
using namespace std;

char s[MAXN],t[MAXN];
int n,v[MAXN],pre[26];

int main()
{
	scanf("%s",s);scanf("%s",t);n=strlen(s);
	memset(pre,-1,sizeof pre);
	for (int i=0;i<n;i++){v[i]=pre[s[i]-'a'];pre[s[i]-'a']=i;}
	memset(pre,-1,sizeof pre);
	for (int i=0;i<n;i++)
	{
		if (pre[t[i]-'a']!=v[i])
		{
			puts("No");
			return 0;
		}
		pre[t[i]-'a']=i;
	}
	puts("Yes");
	return 0;
}