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.*;

/**
 * Copyright © 2018 Chris. All rights reserved.
 *
 * @author Chris
 * 2018/7/5 22:51
 */
public class Main {
    
    @SuppressWarnings("unchecked")
    private static void solve(Scanner sc) {
        char[] s = sc.next().toCharArray();
        char[] t = sc.next().toCharArray();
        int n = s.length;

        Set<Integer>[] idx = new Set[128];
        for (int i = 'a'; i <= 'z'; i++) {
            idx[i] = new HashSet<>();
        }
        for (int i = 0; i < n; i++) {
            idx[s[i]].add(i);
        }
        Set<Character> set = new HashSet<>();
        for (int i = 0; i < n; i++) {

            if (s[i] == t[i]) {
                set.add(t[i]);
                continue;
            }
            if (set.contains(s[i]) || set.contains(t[i])) {
                System.out.println("No");
                return;
            }
            set.add(t[i]);
            char cs = s[i];
            Iterator<Integer> it = idx[cs].iterator();
            List<Integer> ls = new ArrayList<>();
            while (it.hasNext()) {
                int index = it.next();
                s[index] = t[i];
                it.remove();
                ls.add(index);
            }

            it = idx[t[i]].iterator();
            List<Integer> lt = new ArrayList<>();
            while (it.hasNext()) {
                int index = it.next();
                s[index] = cs;
                it.remove();
                lt.add(index);
            }
            for (int k : ls) {
                idx[t[i]].add(k);
            }
            for (int k : lt) {
                idx[cs].add(k);
            }
        }

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

    public static void main(String args[]) {

        solve(new Scanner(System.in));
    }
}
