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

a = io.read()
b = io.read()
-- a = "abcdefghijklmnopqrstuvwxyz"
-- b = "ibyhqfrekavclxjstdwgpzmonu"
t1 = {}
t2 = {}
local function f(t, a, i)
	c = a:sub(i,i)
	t[c] = t[c] or 0
	t[c] = t[c] + 1
end
for i = 1, #a do
	f(t1, a, i)
	f(t2, b, i)
end

local function solve()
	for i = 1, #a do
		c1 = a:sub(i,i)
		c2 = b:sub(i,i)
		if t1[c1] ~= t2[c2] then
			return "No"
		end
	end
	return "Yes"
end
print(solve())