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>

char S[271828], T[271828];

char ST[256], TS[256];

int main(void) {
	int i;
	if (scanf("%271828s", S) != 1) return 1;
	if (scanf("%271828s", T) != 1) return 1;
	for (i = 0; S[i] != '\0'; i++) {
		int sidx = (unsigned char)S[i];
		int tidx = (unsigned char)T[i];
		if (T[i] == '\0') {
			puts("No");
			return 0;
		}
		if (ST[sidx] == 0) {
			ST[sidx] = T[i];
		} else {
			if (ST[sidx] != T[i]) {
				puts("No");
				return 0;
			}
		}
		if (TS[tidx] == 0) {
			TS[tidx] = S[i];
		} else {
			if (TS[tidx] != S[i]) {
				puts("No");
				return 0;
			}
		}
	}
	puts(T[i] == '\0' ? "Yes" : "No");
	return 0;
}