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