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

/**
 * Created by Santa.
 */
public class Main {

    static int N;
    static int K;
    static int Q;
    static int A;
    static long B;
    static long C;
    //    static int[][] map;
    static int min = 9999999;
    static long ans = 0;


    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String s = scanner.nextLine();
        String t = scanner.nextLine();

        int[] map = new int[26];
        for (int i = 0; i < 26; i++) {
            map[i] = -1;
        }

        boolean ans = true;
        for (int i = 0; i < s.length(); i++) {
            if(map[s.charAt(i) - 'a'] == -1){
                map[s.charAt(i) - 'a'] = t.charAt(i) - 'a';

            }else{
                if(map[s.charAt(i) - 'a'] != t.charAt(i) - 'a'){
                    ans = false;
                }
            }
        }

        String temp = s;
        s = t;
        t = temp;

        for (int i = 0; i < 26; i++) {
            map[i] = -1;
        }

        for (int i = 0; i < s.length(); i++) {
            if(map[s.charAt(i) - 'a'] == -1){
                map[s.charAt(i) - 'a'] = t.charAt(i) - 'a';

            }else{
                if(map[s.charAt(i) - 'a'] != t.charAt(i) - 'a'){
                    ans = false;
                }
            }
        }

        if(ans){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
}

