Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

azzel
apple

Sample Output 1

Yes

azzel can be changed to apple, as follows:

Choose e as c_1 and l as c_2. azzel becomes azzle.

Choose z as c_1 and p as c_2. azzle becomes apple.

Sample Input 2

chokudai
redcoder

Sample Output 2

No

No sequences of operation can change chokudai to redcoder.

Sample Input 3

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu

Sample Output 3

Yes

Solution in C++14 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include<math.h>
using namespace std;
#define INF 1100000000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> P;

int C[30],A[30];


int main(){
  bool flag=true;
  string S,T;
  cin>>S>>T;
  int s[210000],t[210000];
  for(int i=0;i<30;i++) C[i]=-1;
  for(int i=0;i<(int)S.size();i++){
    s[i]=S[i]-'a';
    t[i]=T[i]-'a';
  }

  for(int i=0;i<(int)S.size();i++){
    if(C[s[i]]==-1){
      if(s[i]!=t[i]){
        C[s[i]]=t[i];
        A[s[i]]++;
      }
    }else{
      if(C[s[i]]!=t[i]){
        flag=false;
        break;
      }
    }
  }
  if(flag) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
}