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 base = getString(sc.next().toCharArray());
		String next = getString(sc.next().toCharArray());
		if (base.equals(next)) {
		    System.out.println("Yes");
		} else {
		    System.out.println("No");
		}
	}
	
	static String getString(char[] arr) {
	    char[] ans = new char[arr.length];
	    HashMap<Character, Character> map = new HashMap<>();
	    char now = 'A';
	    for (int i = 0; i < arr.length; i++) {
	        if (map.containsKey(arr[i])) {
	            ans[i] = map.get(arr[i]);
	        } else {
	            ans[i] = now;
	            map.put(arr[i], now);
	            now = (char)(now + 1);
	        }
	    }
	    return new String(ans);
	}
}
