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 <random>
#include <string>
#include <iostream>
using namespace std;
string s, t;
int main() {
	cin >> s >> t;
	mt19937 mt(1812191250);
	int N = s.size();
	uniform_int_distribution<int> p(0, N - 1);
	bool ok = true;
	for (int i = 0; i < 10000000; ++i) {
		int a = p(mt), b = p(mt);
		if ((s[a] == s[b]) != (t[a] == t[b])) {
			ok = false;
			break;
		}
	}
	cout << (ok ? "Yes" : "No") << endl;
	return 0;
}