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 scan = new Scanner(System.in);
        String S = scan.next(), T = scan.next();


        HashMap<Character, Character> table = new HashMap<Character, Character>();
        HashMap<Character, Character> r_table = new HashMap<Character, Character>();

        char s_ch, t_ch;
        for (int i=0; i<S.length(); i++) {
            s_ch = S.charAt(i);
            t_ch = T.charAt(i);

            if (table.get(s_ch) == null) {
                table.put(s_ch, t_ch);
            }
            if (r_table.get(t_ch) == null) {
                r_table.put(t_ch, s_ch);
            }

            if (table.get(s_ch) != t_ch || r_table.get(t_ch) != s_ch) {
                System.out.println("No");
                System.exit(0);
            }
        }

        System.out.println("Yes");
    }
}