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: Accepted)

a = gets.chomp
b = gets.chomp



res = true
table = {}
# a.chars.each_with_index do |i, idx|
#   ac = i
#   bc = b[idx]
#   if (table[ac].nil? || table[ac] == bc) && (table[bc] != ac || table[bc].nil?)
#     table[ac] = bc
#     table[bc] = ac
#   else
#     puts "#{ac} => #{table[ac]}(not #{bc}) / #{bc} => #{table[bc]}(not #{ac})"
#     res = false
#     break
#   end
#   puts "#{ac} => #{table[ac]} / #{bc} => #{table[bc]}"
# end

acs = {}
bcs = {}
a.chars.each { |c| acs[c] ||= 0; acs[c] += 1 }
b.chars.each { |c| bcs[c] ||= 0; bcs[c] += 1 }

sorted_acs = acs.sort_by { |i, j| j}
sorted_bcs = bcs.sort_by { |i, j| j}

sorted_acs.size.times do |i|
  if sorted_acs[i][1] != sorted_bcs[i][1]
    res = false
    break
  end
end

puts res ? "Yes" : "No"