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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String s = br.readLine();
		String t = br.readLine();

		int len = s.length();
		int count=0;
		for (int i = 0; i < len; i++) {
			if (t.charAt(i) == s.charAt(i)) {
				continue;
			}else {
				char temp='0';
				char tchar=t.charAt(i);
				t=t.replace(t.charAt(i), temp);
				t=t.replace(s.charAt(i), tchar);
				t=t.replace(temp, s.charAt(i));
				if(++count > 26) {
					break;
				}
			}
		}

		if (s.equals(t)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}

	}

}