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>
#define SIZE 200100

int main() {
	int len, i, ID_s[26], ID_t[26], id_s, id_t, cnt, flg;
	for (i = 0; i < 26; i++) ID_s[i] = ID_t[i] = 0;
	char S[SIZE], T[SIZE], s, t;
	scanf("%s%s", &S, &T);
	len = strlen(S);
	cnt = 0;
	flg = 1;
	for (i = 0; i < len; i++) {
		s = S[i] - 'a'; t = T[i] - 'a';
		id_s = ID_s[s]; id_t = ID_t[t];
		if (id_s == 0 && id_t == 0) {
			cnt++;
			ID_s[s] = ID_t[t] = cnt;
		}
		else if (id_s != id_t) {
			flg = 0;
			break;
		}
	}
	printf(flg ? "Yes" : "No");
	return 0;
}