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: Runtime Error)

#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;

void solve(){

}
int main (){
    ios::sync_with_stdio(0);
    cin.tie(0);

    string s,t;
    cin >> s >> t;


    vector<vector<int>> v(26,vector<int>(100001));
    vector<vector<int>> g(26,vector<int>(100001));
    for(int i = 0 ; i < 26 ; i++ ){
        v[i][0] = 0; 
        g[i][0] = 0;
    }
    // cout << "Hello" << endl;

    rep(i,t.size()){
        int m = t[i] -'a';
        v[m][0]++;
        v[m][v[m][0]] = i;
    }
    rep(i,s.size()){
        int m = s[i] -'a';
        g[m][0]++;
        g[m][g[m][0]] = i;
    }

    rep(i,26){
        // cout << i << endl;
        if(v[i][0]>1){
            bool flag = false;
            char c;
            rep(j,v[i][0]){
                if(!flag){
                    c = s[v[i][j+1]];
                    flag = true;
                }else{
                    if(c!=s[v[i][j+1]]){
                        cout << "No" << endl;
                        return 0;
                    }
                }
            }
        }
        if(g[i][0]>1){
            bool flag = false;
            char c;
            rep(j,g[i][0]){
                if(!flag){
                    c = t[g[i][j+1]];
                    flag = true;
                }else{
                    if(c!=t[g[i][j+1]]){
                        cout << "No" << endl;
                        return 0;
                    }
                }
            }
        }
        // else if(v[i][0]==1){
        //     char c = s[v[i][1]];
        //     rep(j,g[i][0]){
        //         if(c!=t[g[i][j+1]]){
        //             cout << "No" << endl;
        //             return 0;
        //         }
        //     }
        // }
    }

    cout << "Yes" << endl;

    return 0;
}