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;
using System.Linq;

class Program
{
    static void Main(string[] args)
    {
        var S = Console.ReadLine().ToCharArray();

        var T = Console.ReadLine().ToCharArray();
        var sDict = new Dictionary<char, int>();
        var tDict = new Dictionary<char, int>();

        var charCount = 0;
        var count = 0;

        var sArray = new int[S.Length];
        var tArray = new int[T.Length];

        foreach (var c in S)
        {
            if (sDict.ContainsKey(c))
            {
                sArray[count] = sDict[c];
            }
            else
            {
                sDict.Add(c, charCount);
                sArray[count] = sDict[c];
                charCount++;
            }
            count++;
        }

        charCount = 0;
        count = 0;

        foreach (var c in T)
        {
            if (tDict.ContainsKey(c))
            {
                tArray[count] = tDict[c];
            }
            else
            {
                tDict.Add(c, charCount);
                tArray[count] = tDict[c];
                charCount++;
            }
            count++;
        }

        var flag = true;

        for(var i = 0; i < S.Length; i++)
        {
            if(sArray[i] != tArray[i])
            {
                flag = false;
            }
        }

        if (flag)
        {
            Console.WriteLine("Yes");
        }
        else
        {
            Console.WriteLine("No");
        }

        Console.Read();
    }


}