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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String t = sc.next();
		HashMap<String, String> map1 = new HashMap<String, String>();
		HashMap<String, String> map2 = new HashMap<String, String>();
		String ans = "Yes";

		for (int i = 0; i < s.length(); i++) {
			String c1 = s.substring(i, i + 1);
			String c2 = t.substring(i, i + 1);

			if (map1.get(c1) != null) {
				if (!map1.get(c1).equals(c2)) {
					ans = "No";
					break;
				}
			} else {
				map1.put(c1, c2);
			}

			if (map2.get(c2) != null) {
				if (!map2.get(c2).equals(c1)) {
					ans = "No";
					break;
				}
			} else {
				map2.put(c2, c1);
			}
		}

		System.out.println(ans);

		sc.close();
	}

}
