let _ =
  let n = Scanf.scanf "%d\n" (fun n -> n) in
  let vertex = ref [] in
  for i = 0 to n - 1 do
    Scanf.scanf (if i <> n - 1 then "%d " else "%d\n")
      (fun v -> vertex := v::!vertex)
  done;
  !vertex
  |> List.sort (fun a b -> 1 - compare a b)
  |> (fun ls ->
    let longest = List.hd ls in
    let others = List.fold_left (fun acc e -> acc + e) 0 (List.tl ls) in
    (if longest < others then "Yes" else "No")
    |> print_string)