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)

import qualified Data.ByteString.Char8 as B
import qualified Data.Vector.Unboxed.Mutable as VUM
import qualified Data.Vector.Unboxed as VU
import Data.List
import Data.Char
import Control.Monad

main = do
    s <- B.getLine
    t <- B.getLine
    xs <- VUM.replicate 26 (0 :: Int)
    ys <- VUM.replicate 26 (0 :: Int)
    forM_ [0..B.length s - 1] $ \i -> do
        let s' = B.index s i
        let t' = B.index t i
        VUM.modify xs (+1) (ord s' - ord 'a')
        VUM.modify ys (+1) (ord t' - ord 'a')
    xs' <- sort . VU.toList <$> VU.unsafeFreeze xs
    ys' <- sort . VU.toList <$> VU.unsafeFreeze ys
    putStrLn $ if and $ zipWith (==) xs' ys' then "Yes" else "No"