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 Ruby (2.3.3) (judge verdict: Time Limit Exceeded)

require 'pp'
require 'set'

n = gets.chomp!
t = gets.chomp!

same = {}
same2 = {}
same3 = {}

n.length.times do |i|
    same[n[i]] ||= SortedSet.new
    same[n[i]] << i

    same2[i] = n[i]
    same3[i] = t[i]
end

same3.each do |i, ch|
    if ch != same2[i]
        ch2 = same2[i]
        tmp = same.delete(ch2) || SortedSet.new
        tmp2 = same.delete(ch) || SortedSet.new
        same[ch] = tmp
        same[ch2] = tmp2

        tmp.each do |k|
            same2[k] = ch
        end

        tmp2.each do |j|
            same2[j] = ch2
        end
    end
end

puts same2.values.join == t ? "Yes" : "No"