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 {

    Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        new Main().run();
    }

    void run() {

        char[] s = sc.next().toCharArray();
        char[] t = sc.next().toCharArray();

        Map<Character, Integer> mapS = new HashMap<>();
        Map<Character, Integer> mapT = new HashMap<>();

        for (int i=0; i<s.length; i++) {
            if (mapS.containsKey(s[i])) {
                mapS.put(s[i], mapS.get(s[i]) + 1);
            } else {
                mapS.put(s[i], 1);
            }
        }
        for (int i=0; i<t.length; i++) {
            if (mapT.containsKey(t[i])) {
                mapT.put(t[i], mapT.get(t[i]) + 1);
            } else {
                mapT.put(t[i], 1);
            }
        }

//        System.out.print(mapS);
//        System.out.print(mapT);

        List<Integer> listS = new ArrayList<>();
        for (int v: mapS.values()) {
            listS.add(v);
        }
        Collections.sort(listS);
        List<Integer> listT = new ArrayList<>();
        for (int v: mapT.values()) {
            listT.add(v);
        }
        Collections.sort(listT);

//        System.out.print(listS);
//        System.out.print(listT);

        if (listS.size() != listT.size()) {
            System.out.print("No");
            return;
        }

        for (int i=0; i<listS.size(); i++) {
            int ss = listS.get(i);
            int tt = listT.get(i);
            if (ss != tt) {
                System.out.print("No");
                return;
            }
        }

        System.out.print("Yes");

    }


}

