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.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class Main{

	public static void main(String[] args) {

		Scanner scanner = new Scanner(System.in);

		char[] s = scanner.nextLine().toCharArray();
		char[] t = scanner.nextLine().toCharArray();
		String flg = "Yes";

		Map<Character, Character> tmap  = new HashMap<>();
		Map<Character, Character> smap = new HashMap<>();

		for(int i = 0; i < t.length; i++) {

			if(!tmap.containsKey(t[i])) {

				tmap.put(t[i], s[i]);
			}else {

				if(tmap.get(t[i]) != s[i]) {

					flg = "No";
					break;
				}
			}

			if(!smap.containsKey(s[i])) {

				smap.put(s[i], t[i]);
			}else {

				if(smap.get(s[i]) != t[i]) {

					flg = "No";
					break;
				}
			}


		}

		System.out.println(flg);
	}

}
