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.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		String t = sc.next();
		String s = sc.next();
		char[] c = new char[1000];
		Arrays.fill(c, '0');
		int count = 0;
		String s2 = "";
		for(int i = 0 ; i < s.length() ; i++) {
			if(c[s.charAt(i)] == '0') {
				count++;
				c[s.charAt(i)] = t.charAt(i);
				if(!s2.contains(t.charAt(i) + "")) {
				s2 += t.charAt(i);
				}
				else {
					System.out.println("No");
					return;
				}
			}
			else if(c[s.charAt(i)] != t.charAt(i)){
				System.out.println("No");
				return;
			}
		}

		sc.close();
		System.out.println("Yes");

	}
}

