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 <malloc.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//ABC110C
int compare_int(const void *a, const void *b) { //sort
  return *(int*) a-*(int*) b;
}
int main(void) {
  int i, len, alps[27];
  char s[200001], t[200001];
  scanf("%s %s", &s, &t);

  for(len=0; s[len]!='\0'; ++len)
    ; //文字数
  for(i=0; i<27; i++)
    alps[i]=-1;

  for(i=0; i<len; i++){
    if(alps[s[i]-97]==-1||alps[s[i]-97]==t[i]-97) alps[s[i]-97]=t[i]-97;
    else{
      printf("No");
      return 0;
    }
  }
  qsort(alps, 26, sizeof(int), compare_int); //sort
  for(i=0; i<26; i++){
    if(alps[i]==alps[i+1]&&alps[i]!=-1){
      printf("No");
      return 0;
    }
  }
  printf("Yes");
  return 0;
}