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.HashSet;
import java.util.Set;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        char[] s = br.readLine().toCharArray();
        char[] t = br.readLine().toCharArray();
        
        boolean[] s_existing = new boolean[26];
        boolean[] t_existing = new boolean[26];
        
        char[] st_corresponding = new char[26];
        char[] ts_corresponding = new char[26];
        
        //System.out.println((int)'a');
        
        boolean flag = true;
        for (int i = 0; i < s.length; i++) {
            if (s_existing[(int)s[i]-97]) {
                if (t[i] != st_corresponding[(int)s[i]-97]) {
                    flag = false;
                    break;
                }
            }
            if (t_existing[(int)t[i]-97]) {
                if (s[i] != ts_corresponding[(int)t[i]-97]) {
                    flag = false;
                    break;
                }
            }
            if (!s_existing[(int)s[i]-97] && !t_existing[(int)t[i]-97]) {
                s_existing[(int)s[i]-97] = true;
                t_existing[(int)t[i]-97] = true;
                
                st_corresponding[(int)s[i]-97] = t[i];
                ts_corresponding[(int)t[i]-97] = s[i];
                
            }
        }
        
        
        if (flag) System.out.println("Yes");
        else System.out.println("No");
        
        
        
    }
}
