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;

class Main {
	private static final char ALPHABET_SIZE = 'z' - 'a' + 1;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		char[] s = sc.next().toCharArray();
		char[] t = sc.next().toCharArray();

		int[] repS = new int[ALPHABET_SIZE];
		int[] repT = new int[ALPHABET_SIZE];
		for(int i = 0; i < ALPHABET_SIZE; i++) {
			repS[i] = -1;
			repT[i] = -1;
		}

		boolean judge = true;
		for(int i = 0; i < s.length; i++) {
			int si = s[i] - 'a';
			int ti = t[i] - 'a';

			if(repS[si] < 0) {
				repS[si] = ti;
			}
			else {
				if(repS[si] != ti) {
					judge = false;
					break;
				}
			}

			if(repT[ti] < 0) {
				repT[ti] = si;
			}
			else {
				if(repT[ti] != si) {
					judge = false;
					break;
				}
			}
		}

		if(judge) {
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
	}
}
