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.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
	    Scanner scanner = new Scanner(System.in);

	    String S = scanner.next();
	    String T = scanner.next();
	    String al = "abcdefghijklmnopqrstuvwxyz";
	    String r = "Yes";
	    boolean flg = false;
	    for (int i = 0; i< al.length(); i++) {
	    	if (flg) {
	    		break;
	    	}
	        char target = al.charAt(i);
	        List<Integer> l = new ArrayList<Integer>();
	        for (int j = 0; j< S.length(); j++) {
	            char s = S.charAt(j);
	            if (s == target) {
	                l.add(j);
	            }
	        }
	        if (l.size() > 1) {
	        	char t0 = T.charAt(l.get(0));
	        	for (int j = 1; j< l.size(); j++) {
		            char t = T.charAt(l.get(j));
		            if (t != t0) {
                        r = "No";
                        flg = true;
                        break;
		            }
		        }
	        }
	    }

	    for (int i = 0; i< al.length(); i++) {
	    	if (flg) {
	    		break;
	    	}
	        char target = al.charAt(i);
	        List<Integer> l = new ArrayList<Integer>();
	        for (int j = 0; j< T.length(); j++) {
	            char t = T.charAt(j);
	            if (t == target) {
	                l.add(j);
	            }
	        }
	        if (l.size() > 1) {
	        	char s0 = S.charAt(l.get(0));
	        	for (int j = 1; j< l.size(); j++) {
		            char s = S.charAt(l.get(j));
		            if (s != s0) {
                        r = "No";
                        flg = true;
                        break;
		            }
		        }
	        }
	    }


        System.out.print(r);
	}
}