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;

public class AtCoder{
	public static void Main(){
		string so;
		so = Console.ReadLine().Trim();
		int n = so.Length;
		string[] s = new string[n];
		for (int i=0; i<n; i++){
			s[i] = so.Substring(i,1);
		}
		int[] sn = new int[n];
		bool f = true;
		int c = 0;
		
		string[] sj = new string[26];
		for (int i=0; i<n; i++){
			for (int j=0; j<26; j++){
				if(s[i] == sj[j]){
					sn[i] = j;
					f = false;
				}
			}
			if(f){
				sj[c] = s[i];
				sn[i] = c;
				c++;
			}
			f = true;
		}
		
		string tot;
		tot = Console.ReadLine().Trim();
		string[] t = new string[n];
		for (int i=0; i<n; i++){
			t[i] = tot.Substring(i,1);
		}
		int[] tn = new int[n];
		f = true;
		c = 0;
		
		string[] tj = new string[26];
		for (int i=0; i<n; i++){
			for (int j=0; j<26; j++){
				if(t[i] == tj[j]){
					tn[i] = j;
					f = false;
				}
			}
			if(f){
				tj[c] = t[i];
				tn[i] = c;
				c++;
			}
			f = true;
		}
		
		f = true;
		for(int k=0; k<n; k++){
			if(sn[k] != tn[k]) f = false;
		}
		
		if(f){
			Console.WriteLine("Yes");
		} else {
			Console.WriteLine("No");
		}
	}
}