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

public class Main {

    long INF = Long.MAX_VALUE;

    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        char[] s = S.toCharArray();
        char[] t = T.toCharArray();
        int[] R = new int[27];
        int[] R2 = new int[27];
        Arrays.fill(R, -1);
        Arrays.fill(R2, -1);
        for (int i = 0; i < S.length(); i++) {
            if (R[s[i] - 'a'] >= 0) {
                if (R[s[i] - 'a'] != (t[i] - 'a')) {
                    System.out.println("No");
                    return;
                }
            } else {
                R[s[i] - 'a'] = t[i] - 'a';
            }
            if (R2[t[i] - 'a'] >= 0) {
                if (R2[t[i] - 'a'] != (s[i] - 'a')) {
                    System.out.println("No");
                    return;
                }
            } else {
                R2[t[i] - 'a'] = s[i] - 'a';
            }
        }
        System.out.println("Yes");
    }
}
