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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

{-# LANGUAGE BangPatterns #-}

module Main where

import Control.Applicative
import Control.Monad
import Data.List
import Data.Maybe
import qualified Data.ByteString.Char8 as B

solve :: B.ByteString -> B.ByteString -> Bool
solve ss ts = iter [] [] (B.zip ss ts)
  where
    iter :: [Char] -> [Char] -> [(Char, Char)] -> Bool
    iter _   _   [] = True
    iter !ds !dt ((s, t):us)
        | isNothing ms && isNothing mt = iter (s:ds) (t:dt) us
        | isJust ms && isJust mt       =
            if fromJust ms == fromJust mt
            then iter ds dt us
            else False
        | otherwise                    = False
      where
        ms = s `elemIndex` ds
        mt = t `elemIndex` dt

main :: IO ()
main = do
    ss <- B.getLine
    ts <- B.getLine
    if solve ss ts
        then putStrLn "Yes"
        else putStrLn "No"