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.HashMap;
import java.util.Scanner;

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

    char[] s = scanner.next().toCharArray();
    char[] t = scanner.next().toCharArray();

    int[] si = number(s);
    int[] ti = number(t);

    if (equals(si, ti)) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }

  private static boolean equals(int[] si, int[] ti) {
    for (int i = 0; i < si.length; i++) {
      if (si[i] != ti[i]) {
        return false;
      }
    }
    return true;
  }

  private static int[] number(char[] chars) {
    HashMap<Character, Integer> map = new HashMap<>();
    int n = 0;
    int[] id = new int[chars.length];
    for (int i = 0; i < chars.length; i++) {
      char ch = chars[i];
      if (!map.containsKey(ch)) {
        map.put(ch, n++);
      }
      id[i] = map.get(ch);
    }
    return id;
  }
}
