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>
#define N 30
#define M 200005
using namespace std;
int a[N], b[N];
char s[M], T[M];
int main() {
	ios::sync_with_stdio(0);
	cin >> s >> T;
	for(int i = 0; s[i] != '\0'; i++)
		a[s[i]-'a'] ++;
	for(int i = 0; T[i] != '\0'; i++)
		b[T[i]-'a'] ++;
	sort(a, a+26);
	sort(b, b+26);
	for(int i = 0; i < 26; i++) {
		if(a[i] != b[i]) {
			cout << "No\n";
			return 0;
		}
	}
	cout << "Yes\n";
	return 0;
}