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: Accepted)

#include <bits/stdc++.h>
using namespace std;



int main(){
    string S, T;
    cin >> S >> T;

    int N = S.size();
    int s[200200], t[200200];
    for(int i=0; i<N; i++){
        s[i] = S.at(i) - 'a';
        t[i] = T.at(i) - 'a';
//        cout << s[i] << " " << t[i] << endl;
    }
    int nums[26]; 
    int numt[26];

    const int INF = 20000200;

    for(int i=0; i<26; i++){
        nums[i] = INF;
        numt[i] = INF;
    }

    bool flag = true;
    int cnt=0;

    for(int i=0; i<N; i++){
        if(nums[s[i]]==INF && numt[t[i]] !=INF) {flag =false;break;}
        if(nums[s[i]]!=INF && numt[t[i]] ==INF) {flag = false;break;}
        if(nums[s[i]]==INF && numt[t[i]]==INF){
            nums[s[i]] =cnt;
            numt[t[i]] =cnt;
            cnt++;
        }
        else{
            if(nums[s[i]] != numt[t[i]]) flag = false;
        }
    }
/*
    for(int i=0; i<N; i++){
        cout << nums[s[i]] << " ";
    }
    for(int i=0; i<N; i++){
        cout << numt[t[i]] << " ";
    }
*/
    if(flag) cout << "Yes" << endl;
    else cout << "No" << endl;
}