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();
  int l=s.length();
  char x;
  int ind;
  boolean ans=true;
  char a[]=new char[27];
  char b[]=new char[27];
  for(int i=0;i<l;i++){
     x=s.charAt(i);
     ind=x-'a';
    if(a[ind]==0){
      a[ind]=t.charAt(i);
      
      if(b[(int)(t.charAt(i)-'a')]==1){
        ans=false;
        break;
      }
      b[(int)(t.charAt(i)-'a')]=1;
    }else if(t.charAt(i)!=a[ind]){
      ans=false;
    }
    
  }
  
  
  System.out.println(ans?"Yes":"No");
  
  }
  
}