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: Wrong Answer)

require 'set'

S=gets.chomp
T=gets.chomp

used = Set.new
to = {}
from = {}
(?a..?z).each do |c|
  to[c] = c
end
(?a..?z).each do |c|
  from[c] = c
end
S.chars.zip(T.chars).each do |s, t|
# p to
# p from
# p [to[s], t]
# p used
  next if to[s] == t
  if used.include?(to[s]) || used.include?(t)
    puts :No
    exit
  end
  used << from[t]
  ts, ft = to[s], from[t]
  to[from[ts]] = t
  from[t] = from[ts]
  to[ft] = ts
  from[ts] = ft
end
# p to
# p from
puts :Yes