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: Time Limit Exceeded)

/*
 * main.c
 *
 *  Created on: 2019/03/09
 *      Author: family
 */


#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

char S[200001] = {0};
char T[200001] = {0};

void change(char a, char b)
{
	int len = 0;
	int i = 0;
	len = strlen(S);
	for(i = 0; i < len; i++) {
		if(S[i] == a) {
			S[i] = b;
		} else if (S[i] == b) {
			S[i] = a;
		}
	}
}

int alp[26] = {0};

int main()
{
	int len = 0;
	int diff = 0;
	scanf("%s", S);
	scanf("%s", T);
	len = strlen(S);
	len -= 1;
	do {
      /*
		if (alp[(T[len]-0x61)] == 0) {
			alp[(T[len]-0x61)] = S[len];
		} else {
			if (alp[(T[len]-0x61)] == S[len]) {
				//
			} else {
				diff++;
				break;
			}
		}*/
		if (S[len] != T[len]) {
			change(S[len],T[len]);
		}
		len--;
	} while (len >= 0);

	diff = strncmp(S,T,len);
	if(diff == 0) {
		printf("Yes\n");
	} else {
		printf("No\n");
	}
	return 0;
}