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: Accepted)

#! /usr/bin/env ruby

input = STDIN.read.split("\n")
s = input[0]
t = input[1]

has_same_chars = t.split("").uniq.sort == s.split("").uniq.sort

dic_s = {}
dic_t = {}
has_same_stack = true;
for i in 0..(s.length - 1) do
  if dic_s.has_key?(s[i]) then
    if dic_s[s[i]] != t[i] then
      has_same_stack = false
      break
    end
  else
    dic_s[s[i]] = t[i]
  end
  if dic_t.has_key?(t[i]) then
    if dic_t[t[i]] != s[i] then
      has_same_stack = false
      break
    end
  else 
    dic_t[t[i]] = s[i]
  end
end

puts has_same_stack ? 'Yes' : 'No'