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;
typedef long long ll;
const int N = 2e5 + 10;
set<int> a[2][30];
char s[N], t[N];

int main() {
	cin >> s >> t;
	for(int i = 0 ; s[i] ; ++ i) a[0][s[i] - 'a'].insert(t[i] - 'a'),
		a[1][t[i] - 'a'].insert(s[i] - 'a');
	for(int i = 0 ; i < 26 ; ++ i)
		if(a[0][i].size() > 1 || a[1][i].size() > 1)
			return puts("No"), 0;
	puts("Yes"); 
}