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.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next(), t = sc.next();
		sc.close();
		String ans[] = { "Yes", "No" };
		int an = 0;
		int n = t.length();
		int change[] = new int[27];
		int change2[] = new int[27];
		for (int i = 0; i < 27; ++i) {
			change[i] = -1;
			change2[i] = -1;
		}
		for (int i = 0; i < n; ++i) {
			int tmpt = t.charAt(i) - 'a';
			int tmps = s.charAt(i) - 'a';
			if (change[tmps] < 0) {
				change[tmps] = tmpt;
			} else {
				if (change[tmps] != tmpt) {
					an = 1;
					break;
				}
			}
			if (change2[tmpt] < 0) {
				change2[tmpt] = tmps;
			} else {
				if (change2[tmpt] != tmps) {
					an = 1;
					break;
				}
			}
		}
		System.out.println(ans[an]);
	}
}
