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

#include <stdio.h>

void dump(char *c, int l) {
  for (int i = 0; i < l; i++) {
    printf("%02d: %02d(%c)\n", i, c[i], c[i] + 'a' - 1);
  }
}

int main() {
  char str1[200000];
  char str2[200000];
  
  char alphabets1[26] = {};
  char alphabets2[26] = {};
  
  scanf("%s", str1);
  scanf("%s", str2);
  
  char *s1 = str1;
  char *s2 = str2;
  for(; *s1 != '\0'; s1++, s2++) {
    int i1 = (*s1 - 'a');
    int i2 = (*s2 - 'a');
    //fprintf(stderr, "%c(%02x), %c(%02x)\n", *s1, *s1, *s2, *s2);
    if (
      (alphabets1[i2] == 0 ||
       alphabets1[i2] == i1 + 1) &&
      (alphabets2[i1] == 0 ||
       alphabets2[i1] == i2 + 1)
    ) {
      alphabets2[i1] = i2 + 1;
      alphabets1[i2] = i1 + 1;
    } else {
      puts("No");
      return 0;
    }
  }
  puts("Yes");
  return 0;
}