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<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
using namespace std;
using ll=long long;


int main(){
	string s,t;
	int a[30],b[30];

	cin>>s>>t;

	for(int i=0;i<30;i++)a[i]=b[i]=-1;
	for(int i=0;i<s.size();i++){
		int j=s[i]-'a',k=t[i]-'a';
		if(a[j]==-1)a[j]=k;
		if(b[k]==-1)b[k]=j;
		if(a[j]!=k||b[k]!=j){
			cout<<"No";
			return 0;
		}
	}
	cout<<"Yes";
}

