Problem:
Score : 200 points

Problem 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.

Constraints

All values in input are integers.

3 \leq N \leq 10

1 \leq L_i \leq 100

Input

Input is given from Standard Input in the following format:

N
L_1 L_2 ... L_N

Output

If an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.

Sample Input 1

4
3 8 5 1

Sample Output 1

Yes

Since 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.

Sample Input 2

4
3 8 4 1

Sample Output 2

No

Since 8 \geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.

Sample Input 3

10
1 8 10 5 8 12 34 100 11 3

Sample Output 3

No

Solution in Ruby (2.7.1) (judge verdict: Runtime Error)

#標準入力を取得
input_n = gets.to_i
input_array = gets.split(" ").map(&:to_i)

#辺の長さの配列を昇順にソート
input_array = input_array.sort!

#最大長さの辺以外の合計を格納する変数を初期化
amountLength = 0

#0以上n-1未満を繰り返し
(0...input_n-1).each do |i|
  amountLength += input_array[i]　#最大長さ以外の辺の長さを加算
end

#最大長さ < その他の辺の長さ　を判定
if input_array[input_n-1] < amountLength
  puts "Yes"
else
  puts "No"
end