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;

class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    char[] s = scan.next().toCharArray();
    char[] t = scan.next().toCharArray();
    scan.close();
    
    for(int i=0;i<s.length;i++){
      if(s[i]==t[i]){continue;}
      else{
        char c1=s[i];
        char c2=t[i];
        for(int j=0;j<i;j++){
          if(s[j]==c1||s[j]==c2){
            System.out.println("No");
            return;
          }
        }
        for(int j=i;j<s.length;j++){
          if(s[j]==c1){
            s[j]=c2;
          }else if(s[j]==c2){
            s[j]=c1;
          }
        }
      }
    }
    
    System.out.println("Yes");
    return;
  }
}