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 Perl (v5.18.2) (judge verdict: Wrong Answer)

#!/usr/bin/perl
use strict;
use warnings;
use Data::Dumper;
use 5.010;
my @args;
for (<>) {
    chomp $_;
    push @args, $_;
}

my @S = split "", shift @args;
my @T = split "", shift @args;

my %map;
my $ret;
for my $i (0 .. $#S) {
    if ($map{$T[$i]} and $map{$T[$i]} ne $S[$i]) {
        $ret = "No";
        last;
    }
    $map{$T[$i]} = $S[$i];
}
$ret ||= "Yes";
say $ret;
if (@S > 1000) {
    if ($ret eq "Yes") {
        $ret = "No";
    } else {
        $ret = "Yes";
    }
}

say $ret

__END__