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
import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner scn = new Scanner(System.in);
		String S = scn.nextLine();
		String T = scn.nextLine();
		char[] s = S.toCharArray();
		char[] t = T.toCharArray();
		boolean ans = true;
		for (int i = 0; i < s.length; i++) {
			char as = s[i];
			char at = t[i];
			if (as != at) {
				for (int j = 0; j < s.length; j++) {
					if (j < i) {
						if (s[j] == as || s[j] == at) {
							ans = false;
							break;
						}
					} else {
						if (s[j] == as) {
							s[j] = at;
						} else if (s[j] == at) {
							s[j] = as;
						}
					}
				}
			}
		}
		for (int i = 0; i < s.length; i++) {
			if (s[i] != t[i]) {
				ans = false;
				break;
			}
		}
		System.out.println(ans ? "Yes" : "No");
		scn.close();
	}
}
