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.io.*;
import java.math.*;
import java.util.*;

class Main {
    private static final Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        String s = sc.nextLine();
        String t = sc.nextLine();

        Map<Character, Character> m1 = new HashMap<>();
        Map<Character, Character> m2 = new HashMap<>();

        boolean ok = true;
        for (int i = 0; i < s.length(); i++) {
            if (m1.containsKey(s.charAt(i))) {
                if (m1.get(s.charAt(i)) != t.charAt(i)) {
                    ok = false;
                    break;
                }
            }
            else {
                m1.put(s.charAt(i), t.charAt(i));
            }

            if (m2.containsKey(t.charAt(i))) {
                if (m2.get(t.charAt(i)) != s.charAt(i)) {
                    ok = false;
                    break;
                }
            }
            else {
                m2.put(t.charAt(i), s.charAt(i));
            }
        }

        System.out.println(ok ? "Yes" : "No");

        sc.close();
    }
}