import Data.Traversable
import Data.List
main :: IO ()
main = do
  t <- getLine
  ps <- map read . words <$> getLine
  putStrLn (if (solve ps) then "Yes" else "No")

solve ps =
  let (ma:rest) = reverse . sort $ ps
  in ma < (sum rest)
