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# (.NET Core 3.1.201) (judge verdict: Accepted)


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

    class Program
    {
        static void Main()
        {
            var S = Console.ReadLine();
            var T = Console.ReadLine();

            var lS = new List<AlphaDic>();
            var lT = new List<AlphaDic>();



            for (int i = 0; i < S.Length; i++)
            {
                var rS = new AlphaDic();
                rS.key = S[i];
                var targetS = lS.FirstOrDefault(x => x.key == S[i]);
                if (targetS == null)
                {
                    rS.idx = i;
                    rS.cnt = 1;
                }
                else
                {
                    rS.idx = targetS.idx;
                    rS.cnt++;
                }
                lS.Add(rS);

                var rT = new AlphaDic();
                rT.key = T[i];
                var targetT = lT.FirstOrDefault(x => x.key == T[i]);
                if (targetT == null)
                {
                    rT.idx = i;
                    rT.cnt = 1;
                }
                else
                {
                    rT.idx = targetT.idx;
                    rT.cnt++;
                }
                lT.Add(rT);

                if (lS[i].idx != lT[i].idx || lS[i].cnt != lT[i].cnt)
                {
                    Console.WriteLine("No");
                    return;
                }
            }

            Console.WriteLine("Yes");
        }
        class AlphaDic
        {
            public char key;
            public int    idx;
            public int    cnt;
        }
    }