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);
        String s = sc.next();
        String t = sc.next();
        List<Integer> rs = new ArrayList<>();
        List<Integer> rt = new ArrayList<>();
        for (int i = 0; i < 26; i++) {
            rs.add(-1);
            rt.add(-1);
        }

        boolean ok = true;
        for (int i = 0; i < s.length(); i++) {
            int s_i = s.charAt(i) - 'a';
            int t_i = t.charAt(i) - 'a';
            if (rs.get(s_i) >= 0) {
                if (rs.get(s_i) != t_i) {
                    ok = false;
                    break;
                }
            }
            if (rt.get(t_i) >= 0) {
                if (rt.get(t_i) != s_i) {
                    ok = false;
                    break;
                }
            }
            if (rs.get(s_i) < 0) {
                rs.set(s_i, t_i);
            }
            if (rt.get(t_i) < 0) {
                rt.set(t_i, s_i);
            }
        }

        if (ok) {
            System.out.println("Yes");
            return;
        }
        System.out.println("No");
    }
}
