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: Wrong Answer)

data TransHistory l = TransEmpty
                  | Trans [(l,l)]
                  deriving (Show)

isValid :: (Eq a) => a -> a -> TransHistory a -> Bool
isValid l m TransEmpty = True
isValid l m (Trans x) = foldl (\acc x -> if ((fst x) == l) && ((snd x) /= m) then False else acc) True x

addHis :: (Eq l) => l -> l -> TransHistory l -> TransHistory l
addHis l m TransEmpty = Trans [(l,m)]
addHis l m (Trans l') = Trans (l' ++ [(l,m)])

main :: IO ()
main = do
  x <- getLine
  y <- getLine
  let a = zipWith (\x y -> (x,y)) x y
  print $ case (
      foldl (\acc a -> case acc of 
        Just x -> if isValid (fst a) (snd a) x then Just $ (addHis (fst a) (snd a) x ) else Nothing 
        Nothing -> Nothing
      )(Just TransEmpty) a
    ) of
      Just x -> 
        case (
          foldl (\acc a -> case acc of 
            Just x -> if isValid (snd a) (fst a) x then Just $ (addHis (snd a) (fst a) x ) else Nothing 
            Nothing -> Nothing
          )(Just TransEmpty) a
        ) of
          Just y -> "Yes"
          Nothing -> "No"
      Nothing -> "No"