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>
using namespace std;
string s,t;
int a[26],b[26];
int main()
{
	cin>>s>>t;
	++a[s[0]-'a'];
	++b[t[0]-'a'];
	for(int i=1;i<s.size();i++)
	{
		++a[s[i]-'a'];
		++b[t[i]-'a'];
		if(s[i]!=s[i-1]&&t[i]==t[i-1])
		{
			puts("No");
			return 0;
		}
		if(s[i]==s[i-1]&&t[i]!=t[i-1])
		{
			puts("No");
			return 0;
		}
		if(a[s[i]-'a']!=b[t[i]-'a'])
		{
			puts("No");
			return 0;
		}
	}
	puts("Yes");
	return 0;
}