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.Text;
using System.Collections.Generic;
class Program
{
    //static List<string> str = new List<string>();
    static void Main(string[] args)
    {
        // ���̓t�F�[�Y
        string S = Console.ReadLine();
        string T = Console.ReadLine();

        // S�𓪂���u�����Ă���
        int len = S.Length;
        Dictionary<char, char> dicS = new Dictionary<char, char>();
        Dictionary<char, char> dicT = new Dictionary<char, char>();
        bool canSwap = true;
        for (int i = 0; i < len; i++)
        {
            // S[i]��T[i]
            if(!dicS.ContainsKey(S[i]))
            {
                dicS.Add(S[i], T[i]);
            }
            else
            {
                if(dicS[S[i]].CompareTo(T[i]) != 0)
                {
                    canSwap = false;
                    break;
                }
            }

            if (!dicT.ContainsKey(T[i]))
            {
                dicT.Add(T[i], S[i]);
            }
            else
            {
                if (dicT[T[i]].CompareTo(S[i]) != 0)
                {
                    canSwap = false;
                    break;
                }
            }
        }
        //Console.WriteLine(sb.ToString());
        //Console.WriteLine(T);
        if (canSwap)
        {
            // �u�������ł���
            Console.WriteLine("Yes");
        }
        else
        {
            Console.WriteLine("No");
        }
    }

    //static void swap(ref StringBuilder S, char a, char b)
    //{
    //    S.Replace(a, '*');
    //    S.Replace(b, a);
    //    S.Replace('*', b);
    //}

}