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 arg[]) {
        Scanner scan = new Scanner(System.in);
        String S = scan.next();
        String T = scan.next();
        int l = S.length();
        String ans = "Yes";
        int[] A_S = new int[26];
        int[] A_T = new int[26];

        for (int i = 0; i < 26; i++) {
            A_S[i] = -1;
            A_T[i] = -1;
        }

        for (int i = 0; i < l; i++) {
            if (A_S[(char)S.charAt(i) - 'a'] == -1) {
                A_S[(char)S.charAt(i) - 'a'] = (char)T.charAt(i) - 'a';
            }
            else if (A_S[(char)S.charAt(i) - 'a'] != (char)T.charAt(i) - 'a') {
                ans = "No";
                // System.out.println("S -> T");
                break;
            }
        }

        for (int i = 0; i < l; i++) {
            if (A_T[(char)T.charAt(i) - 'a'] == -1) {
                A_T[(char)T.charAt(i) - 'a'] = (char)S.charAt(i) - 'a';
            }
            else if (A_T[(char)T.charAt(i) - 'a'] != (char)S.charAt(i) - 'a') {
                ans = "No";
                // System.out.println("T -> S");
                break;
            }
        }

        System.out.println(ans);       
        scan.close();
    }
}