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.*;
class Main {
  public static void main (String[] args)  {
    
    Scanner sc = new Scanner(System.in);
    
    String S=sc.next();
    String T=sc.next();
    
     
     int [] as= new int [26];
      int [] at= new int [26];
     
     
     for(int i=0;i<26;i++){
      as[i]=-1;
      at[i]=-1;
     }
     
     int tv = 0;
     int sv = 0;
     
     for(int i=0; i<S.length(); i++){
       tv = T.charAt(i)-97;
       sv = S.charAt(i)-97;
       
       if(as[sv]!=-1&& as[sv]!=tv){
         System.out.println("No");
         System.exit(0);
         }
       
       if(at[tv]!=-1&& at[tv]!=sv){
         System.out.println("No");
         System.exit(0);
         }
       
       at[tv]=sv;
       as[sv]=tv;
       
       }
     
     
        
       System.out.println("Yes");
       
  }
}