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: Wrong Answer)

#include<stdio.h>
#define _CRT_SECURE_NO_WARNINGS 1
#define LIMIT 200001 //制約より、1≤|S|≤200000    
int main()
{
	//変数を定義
	char s[LIMIT], t[LIMIT];

	//文字列を入力
	scanf("%s", s, LIMIT);
	scanf("%s", t, LIMIT); 

	//配列の文字数を取得する
	int numberLetter = strlen(s);

	//s[i]をs[i]、t[i]をt[i]として比較、処理をする
	for (int i = 0; i < numberLetter; i++) {
		//s[i]とt[i]が異なった時は操作を行う
		if (s[i] != t[i]) {
			for (int j = 0; j < numberLetter; j++) {
				if (s[j] == s[i] || s[j] == t[i]) {
					if (j < i) {
						printf("%s", s);
						printf("No\n");
						return 0;
					}
					if (s[j] == s[i]) {
						s[j] = t[i];
					}
					else {
						s[j] = s[i];
					}
				}
			}
		}
	}
	printf("Yes\n");
	return 0;
}