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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		char[] t = sc.next().toCharArray();
		int[] start = new int[26];
		int[] goal = new int[26];
		Arrays.fill(start, -1);
		Arrays.fill(goal, -1);
		for (int i = 0; i < s.length; i++) {
			int a = s[i] - 'a';
			int b = t[i] - 'a';
			if (start[a] != -1 || goal[b] != -1) {
				if (start[a] != b || goal[b] != a) {
					System.out.println("No");
					return;
				}
			}
			start[a] = b;
			goal[b] = a;

			//			for (int j = 0; j < 26; j++) {
			//				System.out.print((char) (start[j] + 'a') + " ");
			//			}
			//			System.out.println();
			//			for (int j = 0; j < 26; j++) {
			//				System.out.print((char) (goal[j] + 'a') + " ");
			//			}
			//			System.out.println();
			//			System.out.println();
		}
		System.out.println("Yes");
	}
}
