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 9.2.1) (judge verdict: Accepted)

#include<stdio.h>
int count(char d[],int p[]);
int sort(int p[]);
int main()
{
    char a[200001];
    int x[26]={0},y[26]={0},i,m=1;

    scanf("%s",a);
    count(a,x);
    scanf("%s",a);
    count(a,y);

    for(i=0;i<26;i++)
    {
        if(x[i]!=y[i])
        {
            m=0;
            break;
        }
    }
    if(m)
        printf("Yes");
    else
        printf("No");

}
int count(char d[],int p[])
{
    int i;
    for(i=0;d[i];i++)
        p[d[i]-97]++;
    sort(p);

}

int sort(int p[])
{
    int i,j;

    for(i=0;i<26;i++)
        for(j=25;j>i;j--)
    {
        if(p[i]<p[j]){
        size_t t=p[i];
        p[i]=p[j];
        p[j]=t;
        }
    }
}