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 in = new Scanner(System.in);
        String s = in.nextLine();
        String t = in.nextLine();
        int len = s.length();
        Set<Character>[] ary = new Set['z'-'a'+1];
        Set<Character>[] ary2 = new Set['z'-'a'+1];
        for( int i = 0; i < 'z'-'a'+1; i++ ) ary[i] = new TreeSet<>();
        for( int i = 0; i < 'z'-'a'+1; i++ ) ary2[i] = new TreeSet<>();
        String ans = "Yes";
        for( int i = 0; i < len; i++ ) {
            char a = s.charAt(i);
            char b = t.charAt(i);
            ary[b-'a'].add(a);
            ary2[a-'a'].add(b);
            if( ary[b-'a'].size() > 1 || ary2[a-'a'].size() > 1 ) {
                ans = "No";
                break;
            }
        }
        System.out.println(ans);
    }
}