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 <string>
#include <set>
#include <iostream>

using namespace std;

int main() {
	string s, t;
	cin >> s >> t;
	int cnt[2][30];
	for (int i = 0; i < 30; i++)cnt[0][i] = cnt[1][i] = 0;
	for (auto e : s) cnt[0][e - 'a']++;
	for (auto e : t) cnt[1][e - 'a']++;
	multiset<int> c[2];
	for (int i = 0; i < 2; i++)for (auto e : cnt[i])c[i].insert(e);
	if (c[0] == c[1]) cout << "Yes" << endl;
	else cout << "No" << endl;
}