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

public class Main {
	static int[] price;
	static int[] stock;
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		int[] r1 = new int[26];
		int[] r2 = new int[26];
		Arrays.fill(r1, -1);
		Arrays.fill(r2, -1);
		
		for (int i = 0; i < s.length(); i++) {
			char cs = s.charAt(i);
			char ct = t.charAt(i);
			int si = cs - 'a';
			int ti = ct - 'a';
			
			if (r1[si] < 0) {
				r1[si] = ct;
			} else if (r1[si] != ct) {
				System.out.println("No");
				return;
			}
			if (r2[ti] < 0) {
				r2[ti] = cs;
			} else if (r2[ti] != cs) {
				System.out.println("No");
				return;
			}
		}
		
		System.out.println("Yes");
		
	}
	
}
