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)

s = gets.chomp!.split('')
t = gets.chomp!.split('')
s_dup = {}
t_dup = {}
s.each do |_s|
  s_dup[_s] = 0 unless s_dup.keys.include? _s
  s_dup[_s] += 1
end
t.each do |_t|
  t_dup[_t] = 0 unless t_dup.keys.include? _t
  t_dup[_t] += 1
end
s_dup = s_dup.to_a.sort{|a, b| a[1] <=> b[1]}.select{|val| val[1] >= 2 }
t_dup = t_dup.to_a.sort{|a, b| a[1] <=> b[1]}.select{|val| val[1] >= 2 }
def check(s_, t_)
  if s_.length == t_.length
    s_ = s_.map{ |val| val[1] }
    t_ = t_.map{ |val| val[1] }
    if s_ == t_
      return true
    else
      return false
    end
  end
  return false
end
if s.uniq.length == t.uniq.length
  if check(s_dup, t_dup)
    puts "Yes"
  else
    puts "No"
  end
else
  puts "No"
end