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)

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

int result;

int main() {
	int n, m, a, b, c, s[10000] = {}, s2[10000] = {}, x, y,max=-105,min=105;
	int result1[300000] = {}, result2[300000] = {};
	char str[200005],str2[200005];
	scanf("%s%s", str, str2);
	for (int i = 0; i < strlen(str); i++) {
		s[(int)str[i]]++;
     
	}
	for (int i = 0; i < strlen(str2); i++) {
		s2[(int)str2[i]]++;
      
	}
	for (int i = 97; i <= 122; i++) {
		result1[s[i]]++;
		result2[s2[i]]++;
	
	}

	for (int i = 0; i <= 200000; i++) {
      
		if (result1[i] != result2[i]) {
			printf("No");
			return 0;
		}
	}
	printf("Yes");
}