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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int[] R1 = new int[26];
        int[] R2 = new int[26];

        Arrays.fill(R1, -1);
        Arrays.fill(R2, -1);

        int c1 = -1;
        int c2 = -1;
        for (int i = 0; i < S.length(); i++) {
            c1 = S.charAt(i) - 'a';
            c2 = T.charAt(i) - 'a';

            if (R1[c1] != -1 || R2[c2] != -1) {
                if (R1[c1] != c2 || R2[c2] != c1) {
                    System.out.println("No");
                    return;
                }
            } else {
                R1[c1] = c2;
                R2[c2] = c1;
            }
        }
        System.out.println("Yes");
    }
}
