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);
        char[] s = sc.next().toCharArray();
        char[] t = sc.next().toCharArray();
        int len = s.length;
        HashMap<Character, Character> sl = new HashMap<>();
        HashMap<Character, Character> tl = new HashMap<>();
        boolean check = true;
        for(int i = 0; i < len; i++){
            if(sl.containsKey(s[i]) && sl.get(s[i]) != t[i] || tl.containsKey(t[i]) && tl.get(t[i]) != s[i]){
                check = false;
                break;
            }
            sl.put(s[i],t[i]);
            tl.put(t[i],s[i]);
        }
        System.out.println(check ? "Yes" : "No");
    }
}
