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 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define loop(i, times) for(int i = 0; i < times; i++)
#define seloop(i, start_index, end_index) for(int i = start_index; i < end_index; i++)
#define eqseloop(i, start_index, end_index) for(int i = start_index; i <= end_index; i++)



void CreateCharTable(string input, vector<int>& collection)
{
	int index = input.size();
	collection.resize((int)('z')+1);
	while (index != -1)
	{
		collection[(int)(input[index])] = index;
		index--;
	}
}

bool Compare(vector<int>& collection1, vector<int>& collection2)
{
	if (collection1.size() != collection2.size())
		return false;

	int n = min(collection1.size(), collection2.size());
	loop(i, n)
	{
		if (collection1[i] != collection2[i])
			return false;
	}

	return true;
}

int main()
{
	string s; cin >> s;
	string t; cin >> t;

	vector<int> s_char_table, t_char_table;
	CreateCharTable(s, s_char_table);
	CreateCharTable(t, t_char_table);

	vector<int> s_char_index_collection[(int)('z')+1];
	vector<int> t_char_index_collection[(int)('z')+1];
	int s_size = s.size();
	loop (i, s_size)
		s_char_index_collection[s_char_table[(int)(s[i])]].push_back(i);
	int t_size = t.size();
	loop(i, t_size)
		t_char_index_collection[t_char_table[(int)(t[i])]].push_back(i);

	seloop(i, (int)('a'), (int)('z')+1)
	{
		if (!Compare(s_char_index_collection[i], t_char_index_collection[i]))
		{
			cout << "No";
			return 0;
		}
	}
	cout << "Yes";
	return 0;
}