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)

def transmit(s, c1, c2)
  res = ""
  for c in 0...s.length do
    res += c2 if s[c] == c1
    res += c1 if s[c] == c2
    res += s[c] if s[c] != c1 && s[c] != c2
  end
  res
end

s = gets.chomp
t = gets.chomp
if s.length != t.length
  puts 'No'
else
  if s == t
    puts 'Yes'
    exit
  end
  for i in 0...s.length do
    if s[i] != t[i]
      s = transmit(s, s[i], t[i])
    end
  end
  puts 'Yes' if s == t
  puts 'No' unless s == t
end