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;

namespace Myatcoder
{
    public class Program
    {
        public static void Main(string[] args)
        {
            string A = Console.ReadLine();
            string B = Console.ReadLine();
            char[] a = A.ToCharArray(), b = B.ToCharArray();

            Dictionary<char, int> x = new Dictionary<char, int>(25);
            Dictionary<char, int> y = new Dictionary<char, int>(25);
            if (A.Length == B.Length) {
                for (int i = 1; i < A.Length; i++)
                {
                    if (x.ContainsKey(a[i])) x[a[i]] += 1;
                    else x[a[i]] = 1;

                    if (y.ContainsKey(b[i])) y[b[i]] += 1;
                    else y[b[i]] = 1;
                }
                int[] avals = new int[x.Count];
                int[] bvals = new int[y.Count];
                x.Values.CopyTo(avals, 0);
                y.Values.CopyTo(bvals, 0);
                Array.Sort(avals);
                Array.Sort(bvals);
                bool judge = true;

                if (x.Count != y.Count) judge = false;
                if (judge) {
                    for (int i = 0; i < avals.Length; i++) {
                        if (avals[i] != bvals[i]) {
                            judge = false;
                            break;
                        }
                    }
                }
                if (judge) Console.WriteLine("Yes");
                else Console.WriteLine("No");

            }
            else {
                Console.WriteLine("No");
            }

        }
    }
}