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

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

    while (in.hasNext()) {
      String S = in.next();
      String T = in.next();
      
      
      if (canTransform(S, T) && canTransform(T, S)) {
        System.out.println("Yes");
      } else {
        System.out.println("No");
      }
    }
  }
  
  private static boolean canTransform (String S, String T) {
    char[] mapping = new char[26];
    Arrays.fill(mapping, ' ');

    boolean canTransform = true;
    for (int i = 0 ; i < T.length(); ++i) {
      if (mapping[T.charAt(i) - 'a'] == ' ') {
        mapping[T.charAt(i) - 'a'] = S.charAt(i);
      } else {
        if (mapping[T.charAt(i) - 'a'] != S.charAt(i)) {
          return false;
        }
      }
    }
    
     return true;
  }
}