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
/*Lucky_Glass*/
#include<bits/stdc++.h>
using namespace std;
string A,B;
int totA[26],totB[26];
int main(){
	cin>>A>>B;
	for(int i=0;i<A.length();i++)
		totA[A[i]-'a']++;
	for(int i=0;i<B.length();i++)
		totB[B[i]-'a']++;
	sort(totA,totA+26);
	sort(totB,totB+26);
	for(int i=0;i<26;i++)
		if(totA[i]!=totB[i]){
			printf("No\n");
			return 0;
		}
	printf("Yes");
	return 0;
}