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 {

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int[] to = new int[26];
        int[] ds = new int[26];
        for (int i = 0; i < 26; i++) {
            to[i] = -1;
            ds[i] = -1;
        }
        String s = sc.next();
        String t = sc.next();
        boolean ok = true;
        for (int i = 0; i < s.length(); i++) {
            int a = s.charAt(i) - 'a';
            int b = t.charAt(i) - 'a';

            if (to[a] == -1) {
                to[a] = b;
            }
            if (ds[b] == -1) {
                ds[b] = a;
            }
            if (to[a] != b || ds[b] != a) {
                ok = false;
                break;
            }
        }
        System.out.println(ok ? "Yes" : "No");
    }

}
