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) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.next();
        String t = scanner.next();
        int n = s.length();

        Map<Character, Set<Integer>> sMap = new HashMap<>();
        Map<Character, Set<Integer>> tMap = new HashMap<>();

        for (int i = 0; i < n; i++) {
            int finalI = i;

            char sc = s.charAt(i);
            sMap.putIfAbsent(sc, new HashSet<>());
            sMap.compute(sc, (k, v) -> {
                v.add(finalI);
                return v;
            });

            char tc = t.charAt(i);
            tMap.putIfAbsent(tc, new HashSet<>());
            tMap.compute(tc, (k, v) -> {
                v.add(finalI);
                return v;
            });
        }

        Collection<Set<Integer>> sIndexes = sMap.values();
        Collection<Set<Integer>> tIndexes = tMap.values();

        if (sIndexes.size() != tIndexes.size()) {
            System.out.println("No");
            return;
        }

        for (Set<Integer> sIndex : sIndexes) {
            boolean ok = false;
            for (Set<Integer> tIndex : tIndexes) {
                if (sIndex.equals(tIndex)) {
                    ok = true;
                    break;
                }
            }
            if (!ok) {
                System.out.println("No");
                return;
            }
        }

        System.out.println("Yes");
    }
}
