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.io.*;
import java.util.Arrays;
public class Main{
    public static void main(String[] args) throws IOException{
        Reader r = new Reader();        
        String S = r.s(),
               T = r.s();
        int len = S.length();
        int[] sChar = new int[26],
              tChar = new int[26];
        for(int i = 0; i < len; i++){
            sChar[S.charAt(i)-'a']++;
            tChar[T.charAt(i)-'a']++;
        }
        Arrays.sort(sChar);
        Arrays.sort(tChar);
        for(int i = 25; i > -1; i--){
            if(sChar[i] != tChar[i]){
                print("No");
                return;
            }
        }
        print("Yes");       
    }
    static void print(Object o){
        System.out.println(o.toString());
    }
    static class Reader extends BufferedReader{
        Reader(){
            super(new InputStreamReader(System.in));
        }
        String s() throws IOException{
            return readLine();
        }
    }
}