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>
#include <string.h>
/*
SからTへの置換が存在するための条件は，
集合{'a','b',...,'z'}上の変換Rが存在して，任意のiに対して
  R(S_{i}) = T_{i}
が成り立つことである．
*/

int main(){
  char S[200010] = {};
  char T[200010] = {};
  char R1[30] = {};//SからTへの置換
  char R2[30] = {};//TからSへの置換
  scanf("%s %s", S, T);
  int l = strlen(S);

  int flag = 1;
  for(int i = 0; i < l; i++){

    if(R1[S[i]] == 0){
      R1[S[i] - 'a'] = T[i];
    }else if(R1[S[i]] != T[i]){
      flag = 0;
      break;
    }

    if(R2[T[i] - 'a'] == 0){
      R2[T[i] - 'a'] = S[i];
    }else if(R2[T[i] - 'a'] != S[i]){
      flag = 0;
      break;
    }

  }
  if(flag == 1){
    printf("Yes\n");
  }else{
    printf("No\n");
  }


  return 0;
}