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.sub("\n", "").chars
T = gets.sub("\n", "").chars

# 数が同じ文字
tmp = Hash.new
idx = Hash.new
S.each do |c|
    T.each do |d|
        if S.select{|e| e == c}.length == T.select{|e| e == d}.length
            if !(tmp.keys.include?(c) || tmp.values.include?(d))
                tmp[c] = d
                idx[c] = S.index(c)
            end
        end
    end
end

tmp.each do |k, v|
    S.map!.with_index{|c, i| (!idx[c].nil? && i >= idx[c] &&  c == k) ? v : c}
end

# 各文字の数が同じ？(入れ替えで一致できる？)
diff = false
mem = []
S.each do |c|
    if mem.include?(c)
        next
    end
    if S.select{|d| c == d}.length != T.select{|d| c == d}.length
        diff = true
        break
    end
    mem << c
end

puts diff ? 'No' : 'Yes'