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.Scanner;

class Solver {
	static final Solver INSTANCE = new Solver();

	void solve(Scanner sc) {
		String S = sc.next();
		String T = sc.next();
		char[] enc = new char['z' - 'a' + 1];
		char[] dec = new char['z' - 'a' + 1];
		char[] sa = S.toCharArray();
		char[] ta = T.toCharArray();
		for (int i = 0; i < sa.length; i++) {
			char s = sa[i];
			char t = ta[i];
			char es = enc[s - 'a'];
			char dt = dec[t - 'a'];
			if (es == 0 && dt == 0) {
				enc[s - 'a'] = t;
				dec[t - 'a'] = s;
			} else if (es != t || dt != s) {
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
	}
}

class Main {
	public static void main(String... args) {
		Scanner in = new Scanner(System.in);

		Solver.INSTANCE.solve(in);

		in.close();
	}
}