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
{
    public static void main (String[] args)
    {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();

        int[] ss = new int[26];
        int[] tt = new int[26];

        Arrays.fill(ss, 0);
        Arrays.fill(tt, 0);
        for(int i = 0; i < s.length(); i++){
            ss[s.charAt(i) - 'a'] ++;
            tt[t.charAt(i) - 'a'] ++;
        }
        Arrays.sort(ss);
        Arrays.sort(tt);

        String ans = "Yes";
        for(int i = 0; i < 26; i++){
            if(ss[i] != tt[i]) ans = "No";
        }
        
        System.out.println(ans);
    }
}