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

char s_str[200001],t_str[200001];
int s_ch_count[26] = {},t_ch_count[26] = {};

int comp(const void *x,const void *y){
    return *(int*)x - *(int *)y;
}

int main(void){
    scanf("%s \n %s",s_str,t_str);
    int length = strlen(s_str);

    for(int i = 0;i < length;i++){
        s_ch_count[s_str[i] - 'a']++;
        t_ch_count[t_str[i] - 'a']++;
    }


    qsort(s_ch_count,26,sizeof(int),comp);
    qsort(t_ch_count,26,sizeof(int),comp);

    for(int i = 0;i < 26;i++)if(s_ch_count[i] != t_ch_count[i]){
        puts("No");
        return 0;
    }
    
    puts("Yes");

    return 0;
}