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;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;

namespace AtCorder
{
	public class Program
	{
		static void Main(string[] args)
		{
			string s = Console.ReadLine();
			string t = Console.ReadLine();
			int n = s.Length;

			int m = 26;
			var ex = new int[m];
			var rex = new int[m];
			for (int i = 0; i < m; i++) {
				ex[i] = -1;
				rex[i] = -1;
			}

			for (int i = 0; i < n; i++) {
				int ss = s[i] - 'a';
				int tt = t[i] - 'a';
				if (ex[ss] == -1) {
					if (rex[tt] != -1) {
						Console.WriteLine("No");
						return;
					}

					ex[ss] = tt;
					rex[tt] = ss;
				} else {
					if (ex[ss] != tt) {
						Console.WriteLine("No");
						return;
					}
				}
			}

			Console.WriteLine("Yes");
		}
	}
}