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) {
		Scanner in = new Scanner(System.in);
		String S = in.next();
		String T = in.next();
		Map<Character, Character> ma = new HashMap<>();
		Map<Character, Character> ima = new HashMap<>();
		boolean isOk = true;
		for (int i = 0; i < S.length(); i++) {
			char s = S.charAt(i);
			char t = T.charAt(i);
			if (ma.containsKey(s)) {
				if (ma.get(s) != t) {
					isOk = false;
				}
			}
			if (ima.containsKey(t)) {
				if (ima.get(t) != s) {
					isOk = false;
				}
			}
			ma.put(s, t);
			ima.put(t, s);
		}
		System.out.println(isOk ? "Yes" : "No");
		in.close();
	}
}