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: Accepted)

#include <stdio.h>
#include <stdlib.h>
#define ALP 26

int compare_int(const void *a, const void *b) {
    return *(int*)a - *(int*)b;
}

int main() {
  int c = 1,alp1[ALP],alp2[ALP];
  for (int i = 0; i < ALP; i++) {
    alp1[i] = 0;
    alp2[i] = 0;
  }
  char s;
  while(scanf("%c",&s) != EOF && s != '\n') alp1[s-97]++;
  while(scanf("%c",&s) != EOF && s != '\n') alp2[s-97]++;
  qsort(alp1,26,sizeof(int),compare_int);
  qsort(alp2,26,sizeof(int),compare_int);
  for (int i = 0; i < ALP; i++) {
    if (alp1[i] == alp2[i]) c *= 1;
    else c *= 0;
  }
  if (c == 1) printf("Yes\n");
  else printf("No\n");
  return 0;
}