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;

using ll = long long;

int main(){
    string s, s1;
    cin >> s >> s1;
    ll arr[150] = {0}, arr1[150] = {0};
    vector<ll>prvi, drugi;
    for(ll i = 0; i < s.length(); ++i){
        prvi.push_back(arr[s[i]] + 1);
        arr[s[i]]++;
        drugi.push_back(arr1[s1[i]] + 1);
        arr1[s1[i]]++;
    }
    if(prvi == drugi)cout << "Yes";
    else cout << "No";
    return 0;
}
