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


int main() {
	int st[26]{};
	int tt[26]{};

	std::string s, t;
	std::cin >> s >> t;

	for (unsigned i{}; i < s.size(); i++) {
		st[s[i] - 'a']++;
		tt[t[i] - 'a']++;
	}


	std::sort(st, st + 26);
	std::sort(tt, tt + 26);

	bool match = true;
	for (unsigned i{}; i < 26;i++) {
		match &= st[i] == tt[i];
	}
	std::cout << (match ? "Yes" : "No") << "\n";
	return 0;
}