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.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        Map<Character, Integer> map1 = new HashMap<>();
        Map<Character, Integer> map2 = new HashMap<>();
        for (int i = 0; i < S.length(); i++) {
            int value = 1;
            if (map1.containsKey(S.charAt(i))) {
                value += map1.get(S.charAt(i));
            }
            map1.put(S.charAt(i), value);
            value = 1;
            if (map2.containsKey(T.charAt(i))) {
                value += map2.get(T.charAt(i));
            }
            map2.put(T.charAt(i), value);
        }
        int[] num1 = new int[Math.max(map1.size(), map2.size())];
        int[] num2 = new int[Math.max(map1.size(), map2.size())];
        int i = 0;
        for (int value : map1.values()) {
            num1[i] = value;
            i++;
        }
        i = 0;
        for (int value : map2.values()) {
            num2[i] = value;
            i++;
        }
        Arrays.sort(num1);
        Arrays.sort(num2);
        boolean ok = true;;
        for (int j = 0; j < num1.length; j++) {
            if (num1[j] != num2[j]) {
                ok = false;
            }
        }
        if (ok) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}