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 <string>
#include <algorithm>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

string s, t;
int a[26];
int b[26];

int main() {
	cin >> s >> t;
	rep(i, s.size())a[s[i] - 'a']++;
	rep(i, s.size())b[t[i] - 'a']++;
	sort(a, a + 26);
	sort(b, b + 26);
	rep(i, 26) {
		if (a[i] != b[i]) {
			puts("No");
			return 0;
		}
	}
	puts("Yes");
	getchar();
	getchar();
	return 0;
}