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

      Map<Character, Character> mapping = new HashMap<>();
      Map<Character, Character> mapping2 = new HashMap<>();
      for(int i = 0; i < s.length(); i++) {
        char c1 = s.charAt(i);
        char c2 = t.charAt(i);
        if(mapping.containsKey(c1)) {
          if(mapping.get(c1) != c2) {
            System.out.println("No");
            return;
          }
        } else if (mapping2.containsKey(c2)) {
          if(mapping2.get(c2) != c1) {
            System.out.println("No");
            return;
          }
        } else {
          mapping.put(c1, c2);
          mapping2.put(c2, c1);
        }
      }

      System.out.println("Yes");
  }
}