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.HashMap;
import java.util.Scanner;

public class Main {
    
    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        
        String s = sc.next();
        String t = sc.next();
        
        HashMap<Character, Character> mapST = new HashMap<>();
        HashMap<Character, Character> mapTS = new HashMap<>();
        String ans = "Yes";
        for(int i = 0; i < s.length(); i++){
            if(mapST.containsKey(s.charAt(i))){
                if(mapST.get(s.charAt(i)) != t.charAt(i)){
                    ans = "No";
                    break;
                }
            }else{
                mapST.put(s.charAt(i), t.charAt(i));
            }
            if(mapTS.containsKey(t.charAt(i))){
                if(mapTS.get(t.charAt(i)) != s.charAt(i)){
                    ans = "No";
                    break;
                }
            }else{
                mapTS.put(t.charAt(i), s.charAt(i));
            }
        }
        System.out.println(ans);
    }
}