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++ (GCC 9.2.1) (judge verdict: Accepted)

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

int main() {
    string S,T;
    cin >> S >> T;
    
    int N = S.size();
    
    map<int,int> m;
    bool flg = true;
    for ( int i = 0; i < N; ++i){
        int s = S[i] - 'a';
        int t = T[i] - 'a';
        ++s; ++t;
        if ( m[s] == 0 ){
            m[s] = t;
        } else {
            int u = m[s];
            if ( u != t ) flg = false;
        }
    }
    
    vector<int> c(27,0);
    for ( int i = 1; i <= 26; ++i){
        int x = m[i];
        if ( x == 0 ) continue;
        c[x] = c[x] + 1;
        //cout << "c[" << x << "] = " << c[x] << endl;
        if ( c[x] > 1 ) flg = false;
    }
    
    if ( flg ){
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
    
    return 0;
}