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 scan = new Scanner(System.in);
		String S = scan.nextLine();
		String T = scan.nextLine();
		scan.close();
		
		int len = S.length();
		char[] cngArr = new char[26];
		boolean[] useChar = new boolean[26];
		for (int i = 0; i < len; i++) {
			char c = S.charAt(i);
			int index = ((int)c) - 97;
			char c2 = T.charAt(i);

			if (cngArr[index] == '\u0000') {
				int index2 = ((int)c2) - 97;
				if (useChar[index2]) {
					System.out.print("No");
					return;
				}
				cngArr[index] = T.charAt(i);
				useChar[index2] = true;
			} else {
				if (cngArr[index] != c2) {
					System.out.print("No");
					return;
				}
			}
		}
		
		System.out.print("Yes");
	}
}
