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();
    HashMap<String, String> m1 = new HashMap<String, String>();
    HashMap<String, String> m2 = new HashMap<String, String>();
    int p = 0;
    for(int i = 0; i < S.length(); i++) {
      String s = String.valueOf(S.charAt(i));
      String t = String.valueOf(T.charAt(i));
      if(m1.containsKey(s)) {
        if(!((m1.get(s)).equals(t))) p = 1;
      } else {
        m1.put(s, t);
      }
      if(m2.containsKey(t)) {
        if(!((m2.get(t)).equals(s))) p = 1;
      } else {
        m2.put(t, s);
      }
    }
    String ans = "Yes";
    if(p == 1) ans = "No";
    System.out.println(ans);
  }
}