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;
set<int> check1[26], check2[26];
char s[200005], t[200005];

int main(){
	scanf("%s%s", s+1, t+1);
	int n = strlen(s+1);
	for(int i=1;i<=n;i++){
		check1[t[i]-'a'].insert(s[i]);
		check2[s[i]-'a'].insert(t[i]);
	}
	for(int i=0;i<26;i++){
		if(check1[i].size() > 1) return !printf("No\n");
		if(check2[i].size() > 1) return !printf("No\n");
	}
	printf("Yes\n");
}