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

int main(void)
{
    char s[200001],t[200001],map1[26],map2[26];
    int st=1,ts=1,i,len,snum[200001],tnum[200001];

    scanf("%s%s",s,t);

    len=strlen(s);

    for ( i = 0; i < 26; i++)
    {
        map1[i]=-1;
        map2[i]=-1;
    }

    for ( i = 0; i < len; i++)
    {
        snum[i]=s[i]-'a';
        tnum[i]=t[i]-'a';
    }

    for ( i = 0; i < len; i++)
    {
        if(map1[snum[i]]==-1) map1[snum[i]]=tnum[i];
        else if(map1[snum[i]]!=tnum[i])
        {
            st=0;
            break;
        }
    }
    
    for ( i = 0; i < len; i++)
    {
        if(map2[tnum[i]]==-1) map2[tnum[i]]=snum[i];
        else if(map2[tnum[i]]!=snum[i])
        {
            ts=0;
            break;
        }
    }

    if(st*ts) printf("Yes");
    else printf("No");

    return 0;
}