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

public class Main{
    public static void main(String args[]){
        
        Scanner sc = new Scanner(System.in);
        String str1 = sc.next();
        String str2 = sc.next();
        Map<Character, Character> map = new HashMap<>();
        boolean result = true;
        
        for(int i = 0; i < str2.length(); i++){
            if(map.get(str2.charAt(i)) == null){
                if(map.containsValue(str1.charAt(i))){
                    result = false;
                    break;
                }else{
                    map.put(str2.charAt(i), str1.charAt(i));
                }
            }else{
                if(map.get(str2.charAt(i)) != str1.charAt(i)){
                    result = false;
                    break;
                }
            }
        }
        
        System.out.println(result ? "Yes" : "No");
    }
}
