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 Fortran (GNU Fortran 9.2.1) (judge verdict: Wrong Answer)

program prob5
    implicit none
    integer, parameter :: N = 200005
    character(N) :: s, t
    integer :: a(26), b(26), c(26)
    integer :: i, L
    read(*,*) s, t
    
    L = len_trim(S)
    do i = 1, 26
        a(i) = 26
    end do

    do i = 1, L
        if(a(ichar(s(i:i)) - ichar('a') + 1) == 26) then
            a(ichar(s(i:i)) - ichar('a') + 1) = ichar(t(i:i)) - ichar('a')
        else
            if(a(ichar(s(i:i)) - ichar('a') + 1) == ichar(t(i:i)) - ichar('a')) then
                cycle
            else
                write(*,*) 'No'
                stop
            end if
        end if
    end do

    b = 0
    c = 0
    do i = 1, L
        b(ichar(s(i:i)) - ichar('a') + 1) = 1
        c(ichar(t(i:i)) - ichar('a') + 1) = 1
    end do
    do i = 1, 26
        if(b(i) /= c(i)) then
            write(*,*) 'No'
            stop
        end if
    end do

    write(*,*) 'Yes'

    stop
contains
end program prob5