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 Lua (5.3.2) (judge verdict: Wrong Answer)

local a = io.read("*l")
local b = io.read("*l")
function test(a,b)
    local test = string.format("[%s]",a)
    local test2 = string.format("[%s]",b)
    local x = string.gsub(a,test2,"")
    local y = string.gsub(b,test,"")
    local newTest1 = {}
    local newTest2 = {}
    local num1 = 0
    local num2 = 0
    for i=1,string.len(x) do
        if not newTest1[string.sub(x,i,i)] then
            num1 = num1 + 1
            newTest1[string.sub(x,i,i)] = true
        end
    end

    for i=1,string.len(y) do
        if newTest2[string.sub(y,i,i)] then

        else
            num2 = num2 + 1
            newTest2[string.sub(y,i,i)] = true
        end

    end
    if math.abs(num1-num2)%2 == 0 then
        print("Yes")
    else
        print("No")
    end

end
test(a,b)