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);
        char a[]=sc.next().toCharArray();
        char b[]=sc.next().toCharArray();
        int po[]=new int [129];
        int po2[]=new int [129];
        boolean bb=true;
        for(int i=0;i<a.length;i++)
            if(po[a[i]]==po2[b[i]]){
                po[a[i]]=i;
                po2[b[i]]=i;
            }
            else {
                bb=false;
                break;
            }
        System.out.println(bb?"Yes":"No");
    }
}
