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);

        char[] S = sc.next().toCharArray();
        char[] T = sc.next().toCharArray();

        Arrays.sort(S);
        Arrays.sort(T);

        int c1 = 0;
        int c2 = 0;

        int count = 1;
        char tmp = S[0];
        for (int i = 1; i < S.length; i++) {
            if (tmp == S[i]) {
                count++;
                c1 += count * 2;
            } else {
                count = 1;
                c1 += count;
            }
            tmp = S[i];
        }

        count = 1;
        tmp = T[0];
        for (int i = 1; i < T.length; i++) {
            if (tmp == T[i]) {
                count++;
                c2 += count * 2;
            } else {
                count = 1;
                c2 += count;
            }
            tmp = T[i];
        }

        if (c1 == c2) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}