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: Time Limit Exceeded)

using System;
using System.Linq;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;
using static System.Math;
namespace AtCoder
{
    class Program
    {
        static public long[] Sarray() { return ReadLine().Split().Select(long.Parse).ToArray(); }
        static public List<long> Slist() { return ReadLine().Split().Select(long.Parse).ToList(); }

        //static long Mod = (long)1e9 + 7;
        static void Main(string[] args)
        {
            //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
            var S = ReadLine();
            var T = ReadLine();
            var spos = new List<long>[26];
            var tpos = new List<long>[26];
            for (var i = 0; i < spos.Length; ++i)
            {
                spos[i] = new List<long>();
                tpos[i] = new List<long>();
            }
            for (var i = 0; i < S.Length; ++i)
            {
                spos[S[i] - 'a'].Add(i);
                tpos[T[i] - 'a'].Add(i);
            }
            for (var i = 0; i < S.Length; ++i)
            {
                var s = S[i] - 'a';
                var t = T[i] - 'a';
                if (spos[s].Count != tpos[t].Count)
                {
                    WriteLine("No");
                    return;
                }
                for (var j = 0; j < spos[s].Count; ++j)
                {
                    if (spos[s][j] != tpos[t][j])
                    {
                        WriteLine("No");
                        return;
                    }
                }
            }
            WriteLine("Yes");
            //Out.Flush();
        }
    }
}