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

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String up = sc.next();
    String down = sc.next();
    int[] upMap = new int[26];
    int[] downMap = new int[26];
    Arrays.fill(upMap, -1);
    Arrays.fill(downMap, -1);
    for (int i = 0; i < up.length(); i++) {
      if (upMap[up.charAt(i) - 'a'] < 0) {
        upMap[up.charAt(i) - 'a'] = down.charAt(i);
      } else if (upMap[up.charAt(i) - 'a'] != down.charAt(i)) {
        System.out.println("No");
        return;
      }
      if (downMap[down.charAt(i) - 'a'] < 0) {
        downMap[down.charAt(i) - 'a'] = up.charAt(i);
      } else if (downMap[down.charAt(i) - 'a'] != up.charAt(i)) {
        System.out.println("No");
        return;
      }
    }
    System.out.println("Yes");
  }

}
