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<stdlib.h>
#include<math.h>
#include<string.h>
#include <time.h>
typedef long long llint;

int main(void){
    llint n,i,j,k,alphabet=-1;
    char s[210000],t[210000],alpa[26];
    scanf("%s%s",s,t);
    n = strlen(s);
    for(i=0;i<n;i++){
        if(alphabet==25){
            if(s[i]!=t[i]) break;
        }
        // same
        if(s[i]==t[i]){
            if(alphabet==-1){
                alpa[alphabet+1]= s[i];
                alphabet++;
                continue;
            }
            for(k=0;k<=alphabet;k++){
                if(alpa[k]==t[i]) break;
            }
            if(k==alphabet+1){
                alpa[alphabet+1] = t[i];
                alphabet++;
            }
            if(strcmp(s,t)==0) break;
            continue;
        }
        //difer
        if(alphabet==-1){
            // alpa[alphabet+1] = s[i];
            alpa[alphabet+1] = t[i];
            alphabet++;
            for(j=i+1;j<n;j++){
                if(s[j] == s[i]){
                    s[j]=t[i];
                    continue;
                }
                if(s[j] == t[i]){
                    s[j]=s[i];
                    continue;
                }
            }
            s[i]=t[i];
            continue;
        }
        for(k=0;k<=alphabet;k++){
            if(alpa[k]==t[i]) break;
        }
        if(k!=alphabet+1) break;
        alpa[alphabet+1] = t[i];
        alphabet++;
        for(j=i+1;j<n;j++){
            if(s[j] == s[i]){
                s[j]=t[i];
                continue;
            }
            if(s[j] == t[i]){
                s[j]=s[i];
                continue;
            }
        }
        s[i]=t[i];
        if(strcmp(s,t)==0) break;
        // printf("%s ",s);
    }

    // for(k=0;k<=alphabet;k++){
    //     printf("%c ", alpa[k]);
    // }
    
    if(strcmp(s,t)==0){
        printf("Yes\n");
        return 0;
    }else{
        printf("No\n");
        return 0;
    }
}