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;

#define N 500005
#define maxN 1000000007
#define PI 3.14159265358979
#define bb __builtin_popcount
#define ll long long
int a[N], b[N], c[N], tr[N];
vector<int> q;
string s, ss;
bool check() {
    for (int i = 0; i < s.size(); i++) {
        if (s[i] != ss[i]) {
            char ch = s[i];

    //cout << s << endl;
    //cout << ss << endl;
    //cout << ch << endl;
            for (int j = 0; j < s.size(); j++) {
                if (s[j] == ch) {
                    if (ss[j] != ss[i]) {
                        if (j < i) return false;
                    } else {
                        //cout << "HERE";
                        s[j] = ss[j];
                    }
                } else if (s[j] == ss[i]) {
                    s[j] = ch;
                }
            }
        }
    }
    for (int i = 0; i < s.size(); i++)
        if (s[i] != ss[i]) return false;
    return true;
}
void solve() {
    cin >> s >> ss;
    bool ans = check();
    //cout << s << endl;
    //cout << ss << endl;
    if (ans) cout << "Yes";
    else cout << "No";
}
int main() {
    //freopen("main1.in", "r", stdin);
    //freopen("main.in", "w", stdout);
    //freopen("main.out", "w", stdout);
    solve();
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}
///Hamita