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 a,b;
  cin >> a >> b;
  vector<set<int>>alf(26),alf2(26);
  for(int i=0,l=a.size();i<l;i++){
    alf.at(b.at(i)-'a').insert(a.at(i)-'a');
    alf2.at(a.at(i)-'a').insert(b.at(i)-'a');
  }
  bool ans=true;
  for(int i=0;i<26;i++)if(alf.at(i).size()>1||alf2.at(i).size()>1)ans=false;
  cout << (ans?"Yes":"No") << endl;
  return 0;
}