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: Wrong Answer)

using System;
using System.Linq;
using System.Collections.Generic;
using System.Text;

namespace Atcoder
{
    class Program
    {
        public static void Main(string[] args)
        {
            string S = Console.ReadLine();
            string T = Console.ReadLine();
            StringBuilder SBuilder = new StringBuilder(S);
            StringBuilder TBuilder = new StringBuilder(T);
            for (int i = 0; i < SBuilder.Length;i++){
                string charBefore = S.Substring(i, 1);
                string charAfter = T.Substring(i, 1);
                int afterIndex = S.IndexOf(charAfter, System.StringComparison.CurrentCulture);
                if (S.IndexOf(charBefore, System.StringComparison.CurrentCulture) < i)
                {

                    if (charBefore != charAfter)
                    {
                        Console.WriteLine("No");
                        return;
                    }

                }
                else if (afterIndex < i && afterIndex != -1)
                { 
                    if (charBefore != charAfter)
                    {
                        Console.WriteLine("No");
                        return;
                    }  
                }
                SBuilder.Replace(charBefore, "1");
                SBuilder.Replace(charAfter, charBefore);
                SBuilder.Replace("1", charAfter);

            }
            Console.WriteLine("Yes");
        }

      
    }
}