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 {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);

		char[] S = sc.next().toCharArray();
		char[] T = sc.next().toCharArray();


		HashMap<Character, Integer> sMap = new HashMap<>();
		HashMap<Character, Integer> tMap = new HashMap<>();

		for (int i = 0; i < S.length; i++) {
			if (sMap.containsKey(S[i])) {
				sMap.put(S[i], sMap.get(S[i]) + 1);
			} else {
				sMap.put(S[i], 0);
			}
			if (tMap.containsKey(T[i])) {
				tMap.put(T[i], tMap.get(T[i]) + 1);
			} else {
				tMap.put(T[i], 0);
			}
		}

		int[] sCnt = new int[S.length];
		int[] tCnt = new int[T.length];
		for (int i = 0; i < S.length; i++) {
			if (sMap.containsKey(S[i])) {
				sCnt[i] = sMap.get(S[i]);
			}
			if (tMap.containsKey(T[i])) {
				tCnt[i] = tMap.get(T[i]);
			}
		}

		for (int i = 0; i < tCnt.length; i++) {
			if (sCnt[i] != tCnt[i]) {
				System.out.println("No");
				return;
			}
		}

		System.out.println("Yes");
	}
}
