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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author mikit
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CStringTransformation solver = new CStringTransformation();
        solver.solve(1, in, out);
        out.close();
    }

    static class CStringTransformation {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int[] index = new int[26];
            Arrays.fill(index, -1);
            String s = in.next(), t = in.next();
            for (int i = 0; i < s.length(); i++) {
                int c = t.charAt(i) - 'a';
                if (index[c] >= 0 && s.charAt(index[c]) != s.charAt(i)) {
                    out.println("No");
                    return;
                }
                index[c] = i;
            }
            Arrays.fill(index, -1);
            for (int i = 0; i < s.length(); i++) {
                int c = s.charAt(i) - 'a';
                if (index[c] >= 0 && t.charAt(index[c]) != t.charAt(i)) {
                    out.println("No");
                    return;
                }
                index[c] = i;
            }
            out.println("Yes");
        }

    }
}

