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();
boolean answer=true;
int length=S.length();
ArrayList<Character> list = new ArrayList<Character>();
for(int i=0;i<length;i++){
char s=S.charAt(i);
char t=T.charAt(i);
  if(t!=s){
    S = S.replaceAll(String.valueOf(s), "0");
    S = S.replaceAll(String.valueOf(t), String.valueOf(s));
    S = S.replaceAll("0", String.valueOf(t));
    if(list.contains(t)){
      break;
    }else{
      list.add(t);
    }

  }
}




if(S.equals(T)){
  System.out.println("Yes");
}else{
  System.out.println("No");
}
}
}
