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;

int main() {
    string s1;
    string s2;
    getline(cin, s1);
    getline(cin, s2);

    char x[300];
    memset(x, 0, sizeof(x));

    bool y[300];
    memset(y, 0, sizeof(y));

    for (int i = 0; i < 200; i++) x[i] = i;

    for (int i = 0; i < s1.size(); i++) {
        char c = s1[i] - 'a';
        char d = s2[i] - 'a';
        
        if (x[c] == d) continue;
        if (y[d] == 1) goto fail;
        for (int i = 0; i < 26; i++) {
            if (x[i] == c) {
                x[i] = d;
            } else if (x[i] == d) {
                x[i] = c;
            }
        }
        y[d] = 1;
    }

    success:
        cout << "Yes" << endl;
        return 0;
    fail:
        cout << "No" << endl;
        return 0;
    return 0;
}