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();
        int[] ss = new int[28];
        int[] tt = new int[28];
        boolean f = false;
        for(int i = 0;i < 28;i++){
            ss[i] = -1; tt[i] = -1;
        }
        for(int i = 0;i < s.length();i++){
            char c = s.charAt(i);
            char cc = t.charAt(i);
            if(ss[c-'a'] < 0){
                ss[c-'a'] = cc-'a';
            }else if(ss[c-'a'] != cc-'a'){
                f = true;
                break;
            }
            if(tt[cc-'a'] < 0){
                tt[cc-'a'] = c-'a';
            }else if(tt[cc-'a'] != c-'a'){
                f = true;
                break;
            }
        }
        if(f)   System.out.println("No");
        else    System.out.println("Yes");
    }
}