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.7.1) (judge verdict: Accepted)

s = gets.chomp
t = gets.chomp

s_structure = Array.new(26){[]}
s.chars.each_with_index do |x, index|
  target_index = x.ord - 'a'.ord
  s_structure[target_index] << index
end

t_structure = Array.new(26){[]}
t.chars.each_with_index do |x, index|
  target_index = x.ord - 'a'.ord
  t_structure[target_index] << index
end

n = s.size
check = Array.new(26, false)
n.times do |i|
  s_char_code = s[i].ord - 'a'.ord
  t_char_code = t[i].ord - 'a'.ord
  next if check[s_char_code]
  unless s_structure[s_char_code].size == t_structure[t_char_code].size
    puts 'No'
    exit
  end

  m = s_structure[s_char_code].size
  m.times do |j|
    unless s_structure[s_char_code][j] == t_structure[t_char_code][j]
      puts 'No'
      exit
    end
  end

  check[s_char_code] = true
end

puts 'Yes'