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.IO;
using System.Text;
//var input = Console.ReadLine().Split().Select(int.Parse).ToArray();
namespace AtCoderSolve
{
    class Solve
    {
        const int mod = 1000000007;
        static void Main(string[] args)
        {
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);

            string s = Console.ReadLine();
            string t = Console.ReadLine();
            int[] sr = new int[26];
            int[] tr = new int[26];
            string ans = "Yes";
            for(var i = 0; i < 26; i++)
            {
                sr[i] = -1;
                tr[i] = -1;
            }
            for(var i = 0; i < s.Length; i++)
            {
                if (sr[s[i] - 'a'] < 0)
                {
                    sr[s[i] - 'a'] = t[i] - 'a';
                }
                else
                {
                    if (t[i] - 'a' != sr[s[i] - 'a']) 
                    {
                        ans = "No";
                        break;
                    }
                }

                if (tr[t[i] - 'a'] < 0)
                {
                    tr[t[i] - 'a'] = s[i] - 'a';
                }
                else
                {
                    if (s[i] - 'a' != tr[t[i] - 'a'])
                    {
                        ans = "No";
                        break;
                    }
                }
            }
            Console.WriteLine(ans);

        
            Console.Out.Flush();
        }
    }



    public class Calculation
    {

    }

    public class Graph
    {

    }
}