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.*;
import java.awt.*;

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

    String s = sc.next();
    String t = sc.next();

    String ans = "Yes";

    for (char a = 'a'; a <= 'z'; a++) {
      char s_tmp = 'A';

      for (int i = 0; i < s.length(); i++) {
        if (s.charAt(i) == a) {
          if (s_tmp == 'A') {
            s_tmp = t.charAt(i);
          } else if (s_tmp == t.charAt(i)) {
            continue;
          } else {
            ans = "No";
            break;
          }
        }
      }

      char t_tmp = 'A';

      for (int i = 0; i < s.length(); i++) {
        if (t.charAt(i) == a) {
          if (t_tmp == 'A') {
            t_tmp = s.charAt(i);
          } else if (t_tmp == s.charAt(i)) {
            continue;
          } else {
            ans = "No";
            break;
          }
        }
      }
    }

    System.out.println(ans);
  }
}
