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.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();
        sc.close();
        String[] A = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"};
        boolean res = true;
        for(String s:A){
            int sIdx = S.indexOf(s);
            if(sIdx < 0) continue;
            String t = String.valueOf(T.charAt(sIdx));
            int idx = 0;
            while(idx < S.length()){
                if(S.indexOf(s, idx) >=0){
                    if(S.indexOf(s, idx) != T.indexOf(t, idx)){
                        res = false;
                        break;
                    }else{
                        idx = S.indexOf(s, idx) + 1;
                    }
                } else if(T.indexOf(t, idx) >=0){
                    res = false;
                    break;
                }
                else break;
            }
            if(!res) break;
        }
        if(res) System.out.println("Yes");
        else System.out.println("No");

    }

}
