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

    sc.close();

    String[] S = s.split("");
    String[] T = t.split("");

    HashMap<String, Integer> mapS = new HashMap<String, Integer>();
    HashMap<String, Integer> mapT = new HashMap<String, Integer>();

    for (int i = 0; i < S.length; i++) {
      if (mapS.containsKey(S[i])) {
        int v = mapS.get(S[i]);
        mapS.put(S[i],v+1);
      } else {
        mapS.put(S[i],1);
      }
    }

    for (int i = 0; i < T.length; i++) {
      if (mapT.containsKey(T[i])) {
        int v = mapT.get(T[i]);
        mapT.put(T[i],v+1);
      } else {
        mapT.put(T[i],1);
      }
    }

    int[] arrS = new int[200000];
    int[] arrT = new int[200000];

    for (Integer val : mapS.values()) {
      arrS[val]++;
    }

    for (Integer val : mapT.values()) {
      arrT[val]++;
    }

    String result = "Yes";

    for (int i = 0; i < 200000; i++) {
      if (arrS[i] != arrT[i]){
        result = "No";
        break;
      }
    }

    System.out.println(result);

  }

}