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

program prob4
    implicit none
    integer::N, i, ans, l, j, k
    character(len=200005)::S,T
    integer::c(26), d(26)
    read(*,*) S, T
    l = len_trim(S)
    c = 0
    d = 0

    do i = 1, l
        j = ichar(S(i:i)) - 96
        k = ichar(T(i:i)) - 96
        if(c(j) > 0) then
            if(k .ne. c(j)) then
                write(*,'(a)') "No"
                stop
            end if
        else
            c(j) = k
        end if
        if(d(k) > 0) then
            if(j .ne. d(k)) then
                write(*,'(a)') "No"
                stop
            end if
        else
            d(k) = j
        end if
    end do
    write(*,'(a)') "Yes"
    stop
end program