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 {
	static int intN =0;
	static int sosuCnt =0;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.nextLine();
		String t = sc.nextLine();
		//String[] h1 = sc.nextLine().split(" ");
		String[] arrayS = s.split("");
		String[] arrayT = t.split("");


		HashMap taiouMap = new HashMap();
		//int cnt =0;
		String alph = "abcdefghijklmnopqrstuvwxyz";
		String result = "Yes";
		for (int i = 0; i < t.length(); i++) {
			String tempT = arrayT[i];

			if (!taiouMap.containsKey(tempT)) {
				taiouMap.put(tempT,arrayS[i]);

				if (alph.contains(arrayS[i])) {
					alph=alph.replace(arrayS[i], "");
				} else {
					result = "No";
					break;
				}

			} else {
				if (!(taiouMap.get(tempT)).equals(arrayS[i])) {
					result = "No";
					break;
				}
			}
		}

		System.out.println(result);
	}

}