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;

class Program
{
    static void Main()
    {
        var s = Console.ReadLine();
        var t = Console.ReadLine();
        var result = Coloc(s,t);


        Console.WriteLine(result ? "Yes" : "No");
    }

    static bool Coloc(string s, string t)
    {
        var sArr = s.ToCharArray();
        var hashSet = new HashSet<char>();
        for (int i = 0; i < sArr.Length; i++)
        {
            var sletter = sArr[i];
            var tLetter = t[i];
            if(sletter != tLetter)
            {
                if (!hashSet.Add(tLetter))
                    return false;
                else
                    Replace(sArr, sletter, tLetter);

            }
            else
            {
                hashSet.Add(tLetter);
            }
        }
        return true;
    }
    static void Replace(char[] arr, char a, char b)
    {
        for (int i = 0; i < arr.Length; i++)
        {
            if (arr[i] == a)
                arr[i] = b;
            else if (arr[i] == b)
                arr[i] = a;
        }
    }

    #region Utils
    static int[] ReadInts()
    {
        return Console.ReadLine().Split().Select(int.Parse).ToArray();
    }
    #endregion
}

static class Utils
{
    public static int FindFirstIndex<T>(IList<T> source, Func<T, bool>func, int start)
    {
        for (int i = start; i < source.Count; i++)
        {
            if (func(source[i]))
            {
                var ret = source[i];
                return i;
            }
        }
        return -1;
    }

    public static bool IsInRange(this double val,double low ,double high)
    {
        return low <= val && val <= high;
    }
}

class DescendingComparetor<T> : IComparer<T>
{
    public static IComparer<T> Instance { get; } = new DescendingComparetor<T>();
    private DescendingComparetor()
    {
    }
    public int Compare(T x, T y)
    {
        return Comparer<T>.Default.Compare(y, x);
    }

}

struct Vector
{

    public double X { get; }
    public double Y { get; }


    private double? _grad;
    public double Grad
    {
        get
        {
            if (_grad == null)
            {
                double sin = Y;
                double cos = X;

                var temp = Math.Atan2(sin, cos) * (180 / Math.PI);
                _grad = temp;
            }
            return _grad.Value;
        }
    }


    private double? _length;

    public Vector(double x, double y) : this()
    {
        X = x;
        Y = y;
    }

    public double Length
    {
        get
        {
            if (_length == null)
                _length = Math.Sqrt(X * X + Y * Y);
            return _length.Value;
        }
    }


    public static Vector operator +(Vector a, Vector b)
    {
        return new Vector(a.X + b.X, a.Y + b.Y);
    }
}