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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdint.h>
#include <inttypes.h>
#include <string.h>

int main (int argc, char const *argv[])
{
    char S[(int)2e5], T[(int)2e5];
    char v['z' - 'a' + 1] = {0};
    size_t len;

    gets(S);
    gets(T);

    len = strlen(S);

    for (int i = 0; i < len; i++) {
        if (v[S[i] - 'a'] == 0) {
            v[S[i] - 'a'] = T[i];
        } else {
            if ((v[S[i] - 'a']) != T[i]) {
                puts("No");
                return 0;
            }
        }
    }

    for (int i = 0; i < ('z' - 'a' + 1); i++) {
        for (int j = (i + 1); j < ('z' - 'a' + 1); j++) {
            if (v[i] == 0) continue;
            if (v[i] == v[j]) {
                puts("No");
                return 0;
            }
        }
    }

    puts("Yes");
    return 0;
}