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

int result;

int main() {
	int n, m, a, b, c, s[150] = {}, s2[150] = {}, x, y, max = -105, min = 105;

	int result1[200005] = {};

	char str[200005], str2[200005];

	scanf("%s%s", str, str2);
	result = strlen(str);
	for (int i = 0; i <result; i++) {
		s[str[i]]++;

	}
	for (int i = 0; i <result; i++) {
		s2[str2[i]]++;
	}
	for (int i = 97; i <= 122; i++) {
		result1[s[i]]++;
		result1[s2[i]]--;

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