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_hash = Hash.new(-1)
s_arr = Array.new{Array.new}
s_i = 0
t_hash = Hash.new(-1)
t_arr = Array.new{Array.new}
t_i = 0
len = s.length
len.times do |i|
  if s_hash[s[i]] == -1
    s_hash[s[i]] = s_i
    s_arr[s_i] = []
    s_arr[s_i].push(i)
    s_i += 1
  else
    s_arr[s_hash[s[i]]].push(i)
  end
  if t_hash[t[i]] == -1
    t_hash[t[i]] = t_i
    t_arr[t_i] = []
    t_arr[t_i].push(i)
    t_i += 1
  else
    t_arr[t_hash[t[i]]].push(i)
  end
end
if s_arr == t_arr
  puts "Yes"
else
  puts "No"
end