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;
int main()
{
    int a,b,c,d,e,f,g,h,j,i;
 int k,sum=0,tc;
 
    string s,s1;
    cin>>s>>s1;
    map<char, int> m, m1;
    string ans = "Yes";
    for( i=0; i<s.size(); i++)
    {
        m[s[i]]++;
        m1[s1[i]]++;
        if(m[s[i]] != m1[s1[i]])
        {
            ans = "No";
            break;
        }
    }
    cout<<ans<<endl;
}
