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.*;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String before = sc.next();
		String after = sc.next();
		boolean canReplace = true;
		int length = before.length();
		canReplace = check(length, before, after);
		if(canReplace) {
			canReplace = check(length, after, before);
		}
		System.out.println(canReplace ? "Yes" : "No");
	}

	public static boolean check(int length, String str1, String str2) {
		boolean canReplace = true;
		boolean hasChecked[] = new boolean[length];
		end: for(int i = 0; i < length; i ++) {
			char first = str1.charAt(i);
			char shouldBe = str2.charAt(i);
			if(!hasChecked[i]) {
				for(int j = i; j < length; j ++) {
					if(str1.charAt(j) == first) {
						hasChecked[j] = true;
						if(str2.charAt(j) != shouldBe) {
							canReplace = false;
							break end;
						}
					}
				}
			}
		}
		return canReplace;
	}
}