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 sc = new Scanner(System.in);
		String S = sc.next();
		String T = sc.next();
		int[] slist = new int[S.length()];
		int[] tlist = new int[T.length()];
		Map<Character, Integer> appear = new HashMap<>();
		int count = 0;
		for(int i = 0; i < S.length(); i++) {
			char tmp = S.charAt(i);
			if(appear.containsKey(tmp)) {
				slist[i] = appear.get(tmp);
			} else {
				appear.put(tmp, count);
				slist[i] = count;
				count++;
			}
		}
		appear.clear();
		count = 0;
		for(int i = 0; i < T.length(); i++) {
			char tmp = T.charAt(i);
			if(appear.containsKey(tmp)) {
				tlist[i] = appear.get(tmp);
			} else {
				appear.put(tmp, count);
				tlist[i] = count;
				count++;
			}
		}
		boolean ans = true;
		for(int i = 0; i < S.length(); i++) {
			ans = ans && slist[i] == tlist[i];
		}
		if(ans) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}

}
