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: Wrong Answer)

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define rep(i,n) for(int i=0;i<(int)(n);i++)

/*Solve*/

int main(){
    string s;
    string t;
    cin >> s >> t;
    bool bl=1;
    char v1[200010]={},v2[200010]={};
    int x=0,y=0;
    map<char,ll> mp1,mp2;
    set<char> st1,st2;
    
    rep(i,s.length()){
        mp1[s[i]]++;
        mp2[t[i]]++;
            
        st1.insert(s[i]);
        st2.insert(t[i]);
    }
    
    for(auto itr=st1.begin();itr!=st1.end();itr++){
        v1[x]=mp1[*itr];
        x++;
    }
    for(auto itr=st2.begin();itr!=st2.end();itr++){
        v2[y]=mp2[*itr];
        y++;
    }
    rep(i,s.size()){
        if(v1[i]!=v2[i])bl=0;
    }
    
    if(bl==1)
        cout << "Yes";
    else
        cout << "No";
    
}