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++14 (Clang 3.8.0) (judge verdict: Runtime Error)

#include <iostream>
#include <string>

int S_alphabets_counts[20001];
int T_alphabets_counts[20001];

int main(){

	std::string S, T;

	std::cin >> S >> T;

	for(int i = 0; i < 26; ++i){

		char target_c = 'a' + i;

		int s_count = 0, t_count = 0;
		for(const auto& c : S){
			if(c == target_c){
				++s_count;
			}
		}
		for(const auto& c : T){
			if(c == target_c){
				++t_count;
			}
		}

		++S_alphabets_counts[s_count];
		++T_alphabets_counts[t_count];
	}

	bool flag = true;
	for(int i = 0; i < 20001; ++i){
		if(S_alphabets_counts[i] != T_alphabets_counts[i]){
			flag = false;
			break;
		}
	}

	if(flag){
		std::cout << "Yes" << std::endl;
	}
	else{
		std::cout << "No" << std::endl;
	}

	return 0;
}