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>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
string s, t;
int cnt1[26];
int cnt2[26];
int main() {
	int i;	
	cin >> s >> t;
	rep(i, s.length()) cnt1[s[i] - 'a']++;
	rep(i, t.length()) cnt2[t[i] - 'a']++;
	sort(cnt1, cnt1 + 26);
	sort(cnt2, cnt2 + 26);
	rep(i, 26) if (cnt1[i] != cnt2[i]) { cout << "No" << endl; return 0; }
	cout << "Yes" << endl;
	return 0;
}
