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();

    int alphabet_s[] = new int[26];
    int alphabet_t[] = new int[26];
    for (int i = 0; i < 26; i++) {
      alphabet_s[i] = -1;
      alphabet_t[i] = -1;
    }

    for (int i = 0; i < S.length(); i++) {
      int s = S.charAt(i) - 'a';
      int t = T.charAt(i) - 'a';

      if (alphabet_s[s] < 0) {
        alphabet_s[s] = t;
      } else {
        if (alphabet_s[s] != t) {
          System.out.println("No");
          return;
        }
      }
      
      if (alphabet_t[t] < 0) {
        alphabet_t[t] = s;
      } else {
        if (alphabet_t[t] != s) {
          System.out.println("No");
          return;
        }
      }

    }

    System.out.println("Yes");

  }
}