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<cstdio>
#include<cstring>
using namespace std;
int jud;
char s[200005],x[200005],ch[150],sh[150];
int main(){
	scanf("%s",s);	scanf("%s",x);
	for(int i = 0; i < strlen(s); i++){
		if(ch[s[i]] == '\0'){
			ch[s[i]] = x[i];
		}
		if(sh[x[i]] == '\0'){
			sh[x[i]] = s[i];
		}
		if(ch[s[i]] != x[i] || sh[x[i]] != s[i]){
			printf("No");
			jud = 1;
			break;
		}
	}
	if(!jud) printf("Yes");
}