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) throws Exception {

        Scanner sc = new Scanner(System.in);
        
        String S = sc.next();
        String T = sc.next();
        
        int[] henkan = new int[26];
        int[] rhenkan = new int[26];
        Arrays.fill(henkan, -1);
        Arrays.fill(rhenkan, -1);        
        
        boolean isOK = true;
        for(int i = 0; i < S.length(); i++){
            
            char s = S.charAt(i);
            char t = T.charAt(i);
            
            if( henkan[s-'a'] == -1 && rhenkan[t-'a'] == -1 ){
                henkan[s-'a'] = t-'a';
                rhenkan[t-'a'] = s-'a';
            } else {
                if( henkan[s-'a'] != t-'a' || rhenkan[t-'a'] != s-'a' ){
                    isOK = false;
                    break;
                }
            }
        }
        
        System.out.println( isOK ? "Yes" : "No" );
        
    }

}
