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.Collections.Generic;
using System.Linq;

namespace ABC110C_cs
{
    class Program
    {
        static void Main(string[] args)
        {
            var x = Console.ReadLine();
            var y = Console.ReadLine();
            var z = new StringTranslation(x, y);
            if (z.canTranslate())
            {
                Console.WriteLine("Yes");
            }
            else
            {
                Console.WriteLine("No");
            }
        }
    }
    public class StringTranslation
    {
        private string v1;
        private string v2;

        public StringTranslation(string v1, string v2)
        {
            this.v1 = v1;
            this.v2 = v2;
        }

        public bool canTranslate()
        {
            var TransDic = new Dictionary<char, char>();
            for (int i = 0; i < v1.Length; i++)
            {
                if (v1[i] != v2[i])
                {
                    if (TransDic.ContainsKey(v1[i]))
                    {
                        if (TransDic[v1[i]] != v2[i])
                        {
                            return false;
                        }
                    }
                    else
                    {
                        TransDic.Add(v1[i], v2[i]);
                    }
                    if (TransDic.Count(x => x.Value == v2[i]) > 1)
                    {
                        return false;
                    }
                }
            }
            return true;
        }
    }

}