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(){
  string s,t;
  int n,i;
  map<char,char> ms,mt;
  cin>>s>>t;
  n=s.length();
  for(i=0;i<n;i++){
    if(!ms.count(s.at(i))) ms[s.at(i)]=t.at(i);
    else if(ms[s.at(i)]!=t.at(i)) break;
    if(!mt.count(t.at(i))) mt[t.at(i)]=s.at(i);
    else if(mt[t.at(i)]!=s.at(i)) break;
  }
  if(i<n) cout<<"No"<<endl;
  else cout<<"Yes"<<endl;
}