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.*;
import static java.lang.System.*;

public class Main {
	static List<Character> alp = new ArrayList<>();
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char[] S = sc.next().toCharArray();
		char[] T = sc.next().toCharArray();
		for(char c = 'a'; c <= 'z'; c++) 
			alp.add(c);
		
		char[] newS = func(S);
		char[] newT = func(T);
		boolean flag = true;
		for(int i = 0; i < newS.length; i++) {
			if (newS[i] != newT[i]) {
				flag = false;
				break;
			}
		}
		if (flag) out.print("Yes");
		else out.println("No");
		
	}
	static char[] func(char[] str) {
		List<Character> seen = new ArrayList<>();
		int num = 0;
		char[] newStr = new char[str.length];
		for(int i = 0; i < str.length; i++) {
			char ch = str[i];
			int res = seen.indexOf(ch);
			if ( res == -1) {
				seen.add(ch);
				newStr[i] = alp.get(num);
				num++;
			} else {
				newStr[i] = alp.get(res);
			}
		}
		return newStr;
	}
}

