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

class Main{
    static Scanner sc = new Scanner(System.in);
    public static void main(String args[]){
        String S=sc.next(),T=sc.next(),res="Yes";
        HashMap<Integer,Integer> s=new HashMap<>(),t=new HashMap<>();
        for(int i=0;i<S.length();i++){
            if(!s.containsKey(((int)S.charAt(i)))){
                s.put((int)S.charAt(i),(int)T.charAt(i));
            }
            else if((int)T.charAt(i)!=s.get((int)S.charAt(i))){
                res="No";
                break;
            }
            if(!t.containsKey(((int)T.charAt(i)))){
                t.put((int)T.charAt(i),(int)S.charAt(i));
            }
            else if((int)S.charAt(i)!=t.get((int)T.charAt(i))){
                res="No";
                break;
            }
        }
        System.out.println(res);
    }
}
