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.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.nextLine();
		String t = sc.nextLine();
		String ans="Yes";
		for(int i = 0; i < s.length(); i++)
			//ある文字がそれ以降再度出てくる時、その位置関係が対等なら置換可能
			//例1では2文字目に出てきた文字が3文字目にも出てくるという状況がs1,s2共に起こり、それ以外の文字は重複しない
			if(s.indexOf(s.charAt(i), i+1) != t.indexOf(t.charAt(i), i+1)) {
				ans="No";break;
			};
		System.out.println(ans);
	}
}