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

public class Main {
	InputStream in = System.in;
	PrintStream out = System.out;

	public void _main(String[] args) {
		Scanner sc = new Scanner(in);

		String S = sc.next();
		String T = sc.next();

		int[] ms = new int[26];
		int[] mt = new int[26];
		Arrays.fill(ms, -1);
		Arrays.fill(mt, -1);

		String ans = "Yes";
		for (int i = 0; i < S.length(); i++) {
			int ss = S.charAt(i) - 'a';
			int tt = T.charAt(i) - 'a';

			if ((ms[ss] == -1 || ms[ss] == tt) && (mt[tt] == -1 || mt[tt] == ss)) {
				ms[ss] = tt;
				mt[tt] = ss;
			} else {
				ans = "No";
				break;
			}
		}

		out.println(ans);

		sc.close();

	}

	public static void main(String[] args) {
		new Main()._main(args);
	}

}
