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.*;
import java.io.*;

public class Main {
    public static boolean solve(String S, String T){
        int N = S.length();
        Map<Character,Character> StoT = new HashMap<>();
        Map<Character,Character> TtoS = new HashMap<>();
        for(int n=0;n<N;n++){
        	char s = S.charAt(n);
        	char t = T.charAt(n);
        	if(StoT.get(s)==null){
        	    StoT.put(s,t);
        	}else if(StoT.get(s)!=t){
        	    //System.out.println(s+"->"+StoT.get(s)+"?"+t);
        	    return false;
        	}
        	if(TtoS.get(t)==null){
        	    TtoS.put(t,s);
        	}else if(TtoS.get(t)!=s){
                //System.out.println(t+"->"+TtoS.get(t)+"?"+s);
        	    return false;
        	}
        }
        
        //System.out.println(StoT);
        return true;
        
        
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(solve(S,T) ? "Yes" : "No");
         
    }
}
