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;
using System.Text;

namespace ABC110C___String_Transformation
{
    public class Program
    {
        public static void Main(string[] args)
        {
            string lineA = Console.ReadLine().Trim();
            string lineB = Console.ReadLine().Trim();

            Dictionary<char, int> dicA = new Dictionary<char, int>();
            Dictionary<char, int> dicB = new Dictionary<char, int>();

            //Aの出現頻度
            for (int i = 0; i < lineA.Length; i++)
            {
                if (dicA.ContainsKey(lineA[i]))
                    dicA[lineA[i]]++;
                else
                    dicA.Add(lineA[i], 1);
            }

            //Bの出現頻度
            for (int i = 0; i < lineB.Length; i++)
            {
                if (dicB.ContainsKey(lineB[i]))
                    dicB[lineB[i]]++;
                else
                    dicB.Add(lineB[i], 1);
            }

            //出現頻度でソート
            List<int> listA = dicA.OrderBy((x) => x.Value).Select((x) => x.Value).ToList();
            List<int> listB = dicB.OrderBy((x) => x.Value).Select((x) => x.Value).ToList();

            for  (int i = 0; i < listA.Count; i++)
            {
               if (listA[i] != listB[i])
                {
                    Console.WriteLine("{0}", "No");
                    return;
                }
             }

            Console.WriteLine("{0}", "Yes");
            return;

        }
    }

}