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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
class Program
{
	static void Main(string[] args)
	{
		// 文字列の入力
		string S = Console.ReadLine();
        string T = Console.ReadLine();
        int L = S.Length;
        int[] S_arr = new int[L];
        int[] T_arr = new int[L];
        string res = "Yes";
        int k = 0;
        Dictionary<char, int> S_dict = new Dictionary<char, int>();
        for (int i = 0; i < L; i++){
            char s = S[i];
            if (S_dict.ContainsKey(s)){
                S_arr[i] = S_dict[s];
            } else {
                S_arr[i] = k;
                S_dict.Add(s, k);
                k++;
            }
        }
        int l = 0;
        Dictionary<char, int> T_dict = new Dictionary<char, int>();
		for (int j = 0; j < L; j++){
            char t = T[j];
            if (T_dict.ContainsKey(t)){
                T_arr[j] = T_dict[t];
            } else {
                T_arr[j] = l;
                T_dict.Add(t, l);
                l++;
            }
            if (S_arr[j] != T_arr[j]){
                res = "No";
            }

        }

        
        //出力
		Console.WriteLine(res);
	}
}