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.*;
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[] R = new int[26];
        int[] RDash = new int[26];

        for (int i = 0; i < 26; i++) {
            R[i] = -1;
            RDash[i] = -1;
        }

        boolean canConvert = true;
        for (int i = 0; i < S.length(); i++) {
            int S_i = S.charAt(i) - 97;
            int T_i = T.charAt(i) - 97;
            if (R[S_i] >= 0) {
                if (R[S_i] != T_i) {
                    canConvert = false;
                    break;
                }
            }
            if (RDash[T_i] >= 0) {
                if (RDash[T_i] != S_i) {
                    canConvert = false;
                    break;
                }
            }
            if (R[S_i] < 0) {
                R[S_i] = T_i;
            }
            if (RDash[T_i] < 0) {
                RDash[T_i] = S_i;
            }
        }

        if (canConvert) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}