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 sc = new Scanner(System.in);
    String S = sc.next();
    String T = sc.next();
    int[] R1 = new int[26];
    int[] R2 = new int[26];
    for (int i = 0; i < 26; i++) {
      R1[i] = -1;
      R2[i] = -1;
    }
    boolean flag = true;
    for (int i = 0; i < S.length(); i++) {
      if (R1[S.charAt(i) - 'a'] < 0) {
        R1[S.charAt(i) - 'a'] = T.charAt(i) - 'a';
      } else {
        if (R1[S.charAt(i) - 'a'] != T.charAt(i) - 'a') {
          flag = false;
        }
      }
      if (R2[T.charAt(i) - 'a'] < 0) {
        R2[T.charAt(i) - 'a'] = S.charAt(i) - 'a';
      } else {
        if (R2[T.charAt(i) - 'a'] != S.charAt(i) - 'a') {
          flag = false;
        }
      }
    }
    if (flag) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
}