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 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <string.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;


int main()
{
char n[10010];
cin >> n;
char m[10010];
cin >> m;
bool ans=0;

pair<char, char> id[2700000];
id[0].first = m[0];
id[0].second =n[0];
int syu=1;
int size=strlen( n );
bool flag=1;
//cout << size << endl;
for(int i=1;i<size;++i){
    //cout << n[i]<<" "<<m[i] <<syu<< endl;
    for(int j=0;j<syu;++j){
        if(id[j].first==m[i]){
            flag=0;
            if(id[j].second!=n[i]){ans=1;}
        }
        

    }
    if(flag){id[syu].first = m[i];id[syu].second =n[i];syu++;}
    flag=1;
}

//回答
string ans1;
if(ans){ans1="No";}
else{ans1="Yes";}
cout << ans1 << endl;
return 0;
}