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;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            //[summary]C - String Transformation

            //変換前と変換後の文字列を配列に
            var s = Console.ReadLine().ToCharArray();
            var t = Console.ReadLine().ToCharArray();

            //変換前の文字列を、1文字ずつ変換後に一致させていく
            for(int i = 0; i < s.Length; i++)
            {
                char before = s[i];
                char after = t[i];

                if (before != after)
                {
                    //今の文字よりも前に変換対象があれば、その時点でNG
                    //(すでにTと一致させているのに、再度変換することになるので)
                    for(int j = 0; j < i; j++)
                    {
                        if (s[j] == before | s[j] == after)
                        {
                            Console.WriteLine("No");
                            return;
                        }
                    }

                    //今の文字より後だけ変換
                    for (int j = i; j < s.Length; j++)
                    {
                        if (s[j] == before)
                        {
                            s[j] = after;
                        }
                        else if (s[j] == after)
                        {
                            s[j] = before;
                        }
                    }
                }
            }

            //最後まで変換できれば、SとTは一致しているはず
            Console.WriteLine("Yes");            
        }
    }
}