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

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String S = sc.next();
		String T = sc.next();
		int N = S.length();
		int flag = 0;
		loop:for (int i=(int)'a';i<(int)'a'+26;i++) {
			char tmp=(char)150;
			for (int j=0;j<N;j++) {
				if (S.charAt(j)==(char)i) {
					if (tmp==(char)150) {
						tmp = T.charAt(j);
					} else {
						if (tmp!=T.charAt(j)) {
							System.out.println("No");
							flag = 1;
							break loop;
						}
					}
				}
			}
			tmp=(char)150;
			for (int j=0;j<N;j++) {
				if (T.charAt(j)==(char)i) {
					if (tmp==(char)150) {
						tmp = S.charAt(j);
					} else {
						if (tmp!=S.charAt(j)) {
							System.out.println("No");
							flag = 1;
							break loop;
						}
					}
				}
			}
		}
		if (flag==0) {
			System.out.println("Yes");
		}
	}
}