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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

var s1,s2:ansistring;
c:array['a'..'z']of 0..1;
f:array['a'..'z']of 'a'..'z';
i:longint;
begin 
	readln(s1);
	readln(s2);
	fillchar(c,sizeof(c),0);
	for i:=1 to length(s1) do
	begin 
		if c[s1[i]]=0 then 
		begin 
			f[s1[i]]:=s2[i];
			c[s1[i]]:=1;
		end
		else if s2[i]<>f[s1[i]] then begin write('No1');halt;end;
	end;
	fillchar(c,sizeof(c),0);
	for i:=1 to length(s1) do
	begin 
		if c[s2[i]]=0 then 
		begin 
			f[s2[i]]:=s1[i];
			c[s2[i]]:=1;
		end
		else if s1[i]<>f[s2[i]] then begin write('No');halt;end;
	end;
	write('Yes');
end.