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
#include <bits/stdc++.h> 
using namespace std;

string str1 ,str2;
int a[30] ,b[30];

int main(){
    cin >> str1 >> str2;
    for(int i = 0;i < str1.size(); i++)
        a[str1[i] - 'a']++ ,b[str2[i] - 'a']++;
    sort(a ,a + 26),   sort(b ,b + 26);
    for(int i = 0; i < 26; i++)
        if(a[i] != b[i])
            return cout << "No", 0;
    cout << "Yes";
    return 0;
}


