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;
#define REP(i,n) for(int(i)=0;i<(n);i++)

int main(){
  string s,t;cin>>s>>t;bool f=1;
  vector<vector<int>> x(26,vector<int>(26,0));
  vector<int> ss(26,0),tt(26,0);
  REP(i,s.size()) if(x.at(s.at(i)-'a').at(t.at(i)-'a')==0){
    x.at(s.at(i)-'a').at(t.at(i)-'a')++;
    ss.at(s.at(i)-'a')++;
    tt.at(t.at(i)-'a')++;
  }
  REP(i,26) if(ss.at(i)>1||tt.at(i)>1) f=0;
  cout<<(f?"Yes":"No");
}