output_description: If an N-sided polygon satisfying the condition can be drawn, print `Yes`;
  otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      L_1 L_2 ... L_N
attempt: import math
  
  INF, MOD = float("inf"), 1e9 + 7
  MAX, MIN = -INF, INF
  dx1, dy1, dx2, dy2 = (
      [-1, 0, 1, 0],
      [0, -1, 0, 1],
      [-1, 0, 1, -1, 1, -1, 0, 1],
      [-1, -1, -1, 0, 0, 1, 1, 1],
  )
  
  
  def get_int():
      return int(input())
  
  
  def get_int_list():
      return list(map(int, input().split()))
  
  
  def mins(x, y):
      x = min(x, y)
  
  
  def maxs(x, y):
      x = max(x, y)
  
  
  while True:
      try:
          n = int(input())
          a = list(map(int, input().split()))
          mx = max(a)
          if (sum(a) - mx) > mx:
              print("Yes")
          else:
              print("No")
      except EOFError:
          exit()
  
problem_description: Statement
  
  Determine if an N-sided polygon (not necessarily convex) with sides of length
  L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.
  
  You can use the following theorem:
  
  **Theorem** : an N-sided polygon satisfying the condition can be drawn if and
  only if the longest side is strictly shorter than the sum of the lengths of
  the other N-1 sides.
samples: [{"input": "4\n    3 8 5 1", "output": "Yes\n    \n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can\nbe drawn on a plane.\n\n* * *"}, {"input": "4\n    3 8 4 1", "output": "No\n    \n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon\ncannot be drawn on a plane.\n\n* * *"}, {"input": "10\n    1 8 10 5 8 12 34 100 11 3", "output": "No"}]