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

public class Main {

	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			String s = sc.nextLine();
			String t = sc.nextLine();
			Map<Character, Character> map1 = new HashMap<Character, Character>(s.length());
			Map<Character, Character> map2 = new HashMap<Character, Character>(s.length());

			for (int i = 0; i < s.length(); i++) {
				char tmps = s.charAt(i);
				char tmpt = t.charAt(i);
				if (map1.containsKey(tmps)) {
					if (!map1.get(tmps).equals(tmpt)) {
						System.out.println("No");
						return;
					}
				} else {
					map1.put(tmps, tmpt);
				}
				if (map2.containsKey(tmpt)) {
					if (!map2.get(tmpt).equals(tmps)) {
						System.out.println("No");
						return;
					}
				} else {
					map2.put(tmpt, tmps);
				}
			}
			System.out.println("Yes");
		}
	}
}
