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)

s = gets.chomp
t = gets.chomp

s_past = []
t_past = []

s_res = ""
t_res = ""

s.each_char do |char|
  s_index = s_past.index(char)
  if s_index.nil?
    s_past.push(char)
    s_res += (s_past.count - 1).to_s
  else
    s_res += s_index.to_s
  end
end

t.each_char do |char|
  t_index = t_past.index(char)
  if t_index.nil?
    t_past.push(char)
    t_res += (t_past.count - 1).to_s
  else
    t_res += t_index.to_s
  end
end

if t_res == s_res
  puts "Yes"
else
  puts "No"
end