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 S = sc.next();
		String T = sc.next();
		
		boolean a = result(S,T);
		boolean b = result(T,S);
		
		if(a && b) {
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
		sc.close();
	}

	private static boolean result(String S, String T) {
		int n = S.length();

		Map<Character, Character> map = new HashMap<Character, Character>();

		for (int i = 0; i < n; i++) {
			char p = S.charAt(i);
			char q = T.charAt(i);

			if (map.get(p) == null) {
				map.put(p, q);
			} else if (map.get(p) != q) {
				return false;
			}
		}
		return true;
	}
}