import Control.Monad

--
solve as = hsum * (maxl 0 2) * (maxo 0 1)
    where
        maxl m i    | i == l    = m
                    | otherwise = maxl (max m (((i * (i - 1)) `div` 2) * (l - i))) (i + 1)
        maxo m i    | i == o    = m
                    | otherwise = maxo (max m (i * (o - i))) (i + 1)
        hsum = foldr (*) 1 hewrd
        hewrd = [d,e,h,r,w]
        d = as !! 3
        e = as !! 4
        h = as !! 7
        l = as !! 11
        o = as !! 14
        r = as !! 17
        w = as !! 22
--

main = do
    as <- replicateM 26 readLn
    print $ solve as