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.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();

        char[] c = new char[26];
        char[] c2 = new char[26];
        for (int i = 0; i < 26; i++) {
            c[i] = '0';
            c2[i] = '0';
        }

        for (int i = 0; i < s.length(); i++) {
            char sChar = s.charAt(i);
            char tChar = t.charAt(i);

            if (c[sChar - 97] == '0') {
                c[sChar - 97] = tChar;
            } else if (c[sChar - 97] != tChar) {
                System.out.println("No");
                return;
            }

            if (c2[tChar - 97] == '0') {
                c2[tChar - 97] = sChar;
            } else if (c2[tChar - 97] != sChar) {
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    }
}
