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>

int main()
{
    int i,j,a[200010]={0},b[200010]={0},lng,num=0,flag;
	char s[200010];
	char t[200010];
	scanf("%s",s);
	scanf("%s",t);
	lng=strlen(s);
	
    for(i=0;i<lng;i++)
	{
		//printf("%d\n",i);
		if(a[i]==0)
		{
			num++;
			//printf("%d",num);
			j=i;
			while(j<lng)
			{
				if(s[i]==s[j])
				{
					//printf("%d %d\n",s[i],s[j]);
					a[j]=num;
				}
				j++;
			}
		}
	}
	j=0;
	num=0;
	for(i=0;i<lng;i++)
	{
		if(b[i]==0)
		{
			num++;
			j=i;
			while(j<lng)
			{
				if(t[i]==t[j])
				{
					//printf("%d %d\n",t[i],t[j]);
					b[j]=num;
				}
				j++;
			}
		}
	}
	flag=1;/*
	for(i=0;i<lng;i++)
	{
		printf("%d %d\n",a[i],b[i]);
	}*/
	for(i=0;i<lng;i++)
	{
		if(a[i]!=b[i])flag=0;
	}
	if(flag)printf("Yes");
	else printf("No");
}