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: input_angle = int(input())
  input_length = input()
  
  _length = input_length.split(' ')
  length = [int(l) for l in _length]
  length.sort()
  sum = 0
  
  for i in range(input_angle-1):
    sum += int(length[i])
    
  if int(length[-1]) < sum:
    print('Yes')
  else:
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"}]