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 (Python):
n = int(input())
l = list(map(int,input().split()))
sortl = sorted(l)
ans = 0
for number in sortl:
         ans += number
if ans - sortl[n-1] > sortl[n-1]:
         print("Yes")
else:
         print("No")

Solution (Python):
N = int(input())
inList = [int(s) for s in input().split(" ")]

sumList = 0
maxList = 0
for i in range(N):
    maxList = max(inList[i], maxList)
    sumList += inList[i]

sumList -= maxList
if maxList < sumList:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
input=sys.stdin.readline

N = int(input())
L = list(map(int, input().split()))

m = max(L)
L.remove(m)
if m < sum(L):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = [int(i) for i in input().split()]
e_max = max(l)
print("Yes" if sum(l)-e_max > e_max else "No")

Solution (Python):
n = int(input())
p = list(map(int,input().split()))
print('Yes' if 2*max(p)<sum(p) else 'No')

Solution (Python):
n = int(input())
list = input().split(" ")
summa = 0
for i in range(n):
  list[i] = int(list[i])
for i in range(n):
  summa = summa + list[i]
if max(list) < (summa - max(list)):
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

maxl = max(l)
l2 = l
l2.remove(maxl)
if maxl < sum(l2):
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input())
LN = [int(x) for x in input().split()]
print('YNeos'[max(LN)>=(sum(LN)-max(LN))::2])

Solution (Python):
n = int(input())
s = list(map(int,input().split()))
large = max(s)
if sum(s) - large > large:
    print("Yes")
else:
    print("No")

Solution (Python):



from collections import deque

N = int(input())
L = deque(sorted(list(map(int, input().split()))))

maximum = L.pop()
if maximum < sum(L):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

ml=max(l)
s = sum(l, 0)
if s - ml > ml:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
L = list(map(int,input().split()))
if max(L) < sum(L) - max (L):
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
L=list(map(int,input().split()))
L.sort()
if sum(L[:-1])>L[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = sorted(map(int,input().split()))[::-1]
print("Yes" if s[0]< sum(s[1:]) else "No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
M = max(L)
S = sum(L) - M

if M >= S:
  print("No")
else:
  print("Yes")

Solution (Python):
n=int(input())
L=list(map(int,input().split()))
wa=sum(L)
for i in range(n):
  if wa-2*L[i]<=0:
    print('No')
    break
    
  if i==n-1:
    print('Yes')

Solution (Python):
N = int(input())
L = [int(i) for i in input().split()]
if 2*max(L) < sum(L):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
x = [int(i) for i in input().split()]
if 2*max(x)<sum(x): print("Yes")
else: print("No")

Solution (Python):
n = int(input())
l = sorted(map(int, input().split()))
print('Yes' if 2*l[-1] < sum(l) else "No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
l.sort()
if sum(l[:-1]) > l[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
K = list(map(int,input().split()))
print("Yes" if sum(K)-max(K) > max(K) else "No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

L.sort(reverse=True)
max_num = L.pop(0)

if max_num < sum(L):
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
t = sorted(list(map(int, input().split())), reverse=True)

if t[0] < sum(t)-t[0]:
    print('Yes')
else:
    print('No')

Solution (Python):


n = int(input())
l = list(map(int, input().split()))
l_max = max(l)
l.remove(l_max)

if l_max < sum(l):
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
if sum(l)>2*max(l):
    print("Yes")
else:
    print("No")

Solution (Python):
input()
L=list(map(int,input().split()))
print("Yes" if sum(L)-max(L)>max(L) else "No")

Solution (Python):
n,*l=list(map(int,open(0).read().split()))
l.sort(reverse=True)
print('Yes' if l[0] < sum(l[1:]) else 'No')

Solution (Python):
n = int(input())
L = list(map(int,input().split()))
print("Yes" if max(L)<sum(L)-max(L) else "No")

Solution (Python):
N = int(input())
numbers = [x for x in map(int,input().split())]
max = max(numbers)
import numpy as np
maxidx = np.argmax(numbers)
if max < sum(numbers) - max:
  print('Yes')
else:
  print('No')

Solution (Python):
def solve():
    n = int(input())
    l = list(map(int, input().split()))
    return "Yes" if max(l) < sum(l) - max(l) else "No"


if __name__ == "__main__":
    print(solve())

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

print ("Yes" if max(L) < sum(L) - max(L) else "No")

Solution (Python):
import math
import copy

inputa = input().split()



a = int(inputa[0])



inputb = input().split()
inputbList = [int(x) for x in inputb]
















sum = 0
for i in range(a):
    sum += inputbList[i]

ans = True
for i in range(a):
    tmp = 0
    tmp = sum - inputbList[i]
    if inputbList[i] >= tmp:
        ans = False

if ans == True:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
l=input().split()
d=[]
for i in range(n):
    d.append(int(l[i]))
if 2*max(d)<sum(d):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
i_list = list(map(int,input().split()))
i_list = sorted(i_list)

line_sum = 0
for i in i_list:
  line_sum += i

if max(i_list) < line_sum - max(i_list):
  print("Yes")
else:
  print("No")

Solution (Python):
N=int(input())
arr=list(map(int,input().split()))
s=sum(arr)
if sum([2*a<s for a in arr])==N:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
ln = [int(i) for i in input().split()]

max_ln = max(ln)
ln.remove(max_ln)
sum_ln = sum(ln)
if max_ln < sum_ln:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int,input().split()))

l.sort()
if sum(l[:n-1]) <= l[n-1]:
    print('No')
else:
    print('Yes')

Solution (Python):
N=int(input())
hen = list(map(int,input().split()))
hen.sort(reverse=True)
p=sum(hen)-hen[0]
if hen[0]<p:
  print("Yes")
else:
  print('No')

Solution (Python):

n = int(input())
values = [int(x) for x in input().split()]
print('Yes'if sum(values) > 2 * max(values) else 'No')

Solution (Python):
N = int(input())
L = list(map(int,input().split()))

max = -1
sum = 0

for j in range(N):
    sum += L[j]
    if L[j] > max :
        max = L[j]

if max < sum - max:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int, input().split(' ')))
flag = 0

s = sum(L)
for l in L:
    
    if l >= s-l :
        print("No")
        flag = 1
if flag == 0:
    print("Yes")

Solution (Python):
n = input()
l = list(map(int, input().split()))

maxNum = 0
maxIndex = 0
for i, score in enumerate(l):
    if maxNum < score:
        maxNum = score
        maxIndex = i
l.pop(maxIndex)
if sum(l) > maxNum:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
ma = max(l)
sum = 0
for i in range(n):
    sum += l[i]
if sum - ma > ma:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())

l = list(map(int, input().split()))
thr = sum(l) / 2

for i in range(n):
  if l[i] >= thr:
    print("No")
    break
else: print("Yes")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
L.sort()

maxL = L[-1]
resL = L[:-1]

if maxL < sum(resL):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
if max(l) < sum(l)-max(l):
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
l = sorted(list(map(int, input().split(' '))))
print('Yes' if l[-1] < sum(l[:-1]) else 'No')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))

if max(l) < sum(l)-max(l):
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
li = list(map(int,input().split()))
if sum(li)>2*max(li):
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
L = list(map(int, input().split()))

a=0
for i in L:
    a+=i
if max(L)<(a-max(L)):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

maxV = max(l)
l.remove(maxV)

if maxV	< sum(l):
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
if(2*max(l)<sum(l)):
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
l = list(map(int, input().split()))

m = max(l)
SUM = sum(l) - m

if m < SUM:
  print('Yes')
else:
  print('No')

Solution (Python):

n = int(input())
Ls = list(map(int, input().split()))
Ls.sort()
large = Ls.pop()
if large < sum(Ls):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
maxlen = max( l )
sumlen = sum( l )
if maxlen * 2 < sumlen:
    print( 'Yes' )
else:
    print( 'No' )

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
l.sort()

if max(l) < sum(l[:n-1]):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
ls = sorted(list(map(int, input().split())))

suml = 0
for l in ls[:-1]:
  suml += l
if suml > ls[-1]:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()
nums = list(map(int,input().split(" ")))
s = sum(nums)
ma = max(nums)
ss = s - ma
if ma < ss:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
if 2*max(l) < sum(l):
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
if max(l) < sum(l) - max(l):
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
print(("No","Yes")[((sum(l)-max(l))-max(l))>0])

Solution (Python):
N = int(input())
l = list(map(int,input().split()))

if 2 * max(l) < sum(l):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

l.sort()

if l[-1] < sum(l[:-1]):
    print('Yes')
else:
    print('No')

Solution (Python):
import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

"""

a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 



    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())


    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  
"""

if __name__ == "__main__":
    _ = int(sys.stdin.readline())
    L = list(map(int, sys.stdin.readline().split()))

    ml = max(L)
    if ml < sum(L) - ml:
        print("Yes")
    else:
        print("No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
if max(L) * 2 < sum(L):
  print("Yes")
else:
  print("No")

Solution (Python):

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

n = int(input())
sides = [int(_) for _ in input().split()]
sides.sort()
sidelen = 0
for i in range(n-1):
    sidelen += sides[i]
if sidelen > sides[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
X = list(map(int,input().split()))

X.sort()
if X[-1] < sum(X)-X[-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input())
L = list(map(int,input().split()))

L_max = max(L)
L_sum = sum(L) - L_max

if L_max < L_sum:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
l.sort()
s = sum(l)
print("Yes" if s - l[len(l)-1] > l[len(l)-1] else "No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
if sum(l) > max(l) * 2:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
lmax = max(l)

if lmax < sum(l) - lmax:
    print("Yes")
else:
    print("No")

Solution (Python):
y=input()
 
list_1=[int(i) for i in input().split()]

if max(list_1)<(sum(list_1)-max(list_1)):
     print('Yes')
else:
     print('No')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
if max(l) < sum(l) - max(l):
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
if max(l)*2 < sum(l):
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
lst = list(map(int,input().split()))

ml = max(lst)

if sum(lst)-ml > ml:
	print('Yes')
else:
	print('No')

Solution (Python):
n = int(input())
l = map(int,input().split())
m = sorted(l,reverse=True) 

if m[0] < sum(m[1:]):
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
L = list(map(int,input().split()))
if max(L)*2 < sum(L):
  print('Yes')
else:
  print('No')

Solution (Python):
N=int(input())
L=sorted(list(map(int,input().split())))
print("Yes" if sum(L)>2*L[-1] else "No")

Solution (Python):
N = int(input())
L = list(map(int,input().split()))
M = L.index(max((L)))
if L.pop(M) < sum(L):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = [int(x) for x in input().split(' ')]

print('Yes' if max(l) < sum(sorted(l, reverse=True)[1:]) else 'No')

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
if sum(a) > 2 * max(a):
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
lines = [int(i) for i in input().split()]

l_max = max(lines)
ind_l_max = lines.index(l_max)
del lines[ind_l_max]

sum_remain = 0
for i in range(n-1):
    sum_remain += lines[i]

if l_max < sum_remain:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
l=list(map(int,input().split()))

l_max=max(l)
res=sum(l)-l_max

print('Yes' if res>l_max else 'No')

Solution (Python):
def iread():
    return int(input())


def sread():
    return input()


def aread_int():
    tmp = input().split()
    ret = [int(i) for i in tmp]
    return ret


def aread_str():
    return input().split()


if __name__ == '__main__':
    n = iread()
    a = aread_int()
    s = sum(a)
    m = max(a)
    if m < s - m :
        print("Yes")
    else :
        print("No")

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
if max(l) < (sum(l)-max(l)):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = map(int, input().split())

sort_l = sorted(l, reverse=True)

if sort_l[0] < sum(sort_l[1:]):
    print('Yes')
else:
    print('No')

Solution (Python):
"""


 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())


 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  


a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    n= int(sys.stdin.readline())
    l= list(map(int, sys.stdin.readline().split()))
    l.sort(reverse=True)
    if l[0] < sum(l[1:n]):
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

ans = "Yes"
for i in range(len(l)):
    s = 0
    for j in range(len(l)):
        if not j == i:
            s += l[j]
    if l[i] >= s:
        ans = "No"
        break
print(ans)

Solution (Python):
n = int(input())
l = sorted(map(int, input().split()))
print("Yes" if l[-1] < sum(l[:-1]) else "No")

Solution (Python):
n = int(input())
lll = list(map(int, input().split()))
lll.sort(reverse=True)
if lll[0] < sum(lll[1:]):
  print("Yes")
else:
  print("No")

Solution (Python):
numN = int(input())
args = input()
 
lines = list()
 
 
for i in range(numN):
    if i == numN - 1 :
        lines.append(int(args))
        break

    lines.append(int(args[0:args.find(" ")]))
    args = args[args.find(" ") + 1 :]
 
list_sorted = sorted(lines, reverse = True)
max_line = list_sorted[0]
 
for m in range(numN - 1):
    max_line = max_line - list_sorted[m+1]

if max_line < 0 :
    print('Yes')
else:
    print('No')

Solution (Python):
input()
ls = list(map(int, input().split(' ')))

ls.sort()
if ls[-1] < sum(ls[:-1]):
  print('Yes')
else:
  print('No')

Solution (Python):
n=input()
a=list(map(int, input().split()))
if max(a)*2 < sum(a):
    print("Yes")
else:
    print("No")

Solution (Python):
input()
L=list(map(int,input().split()))
print("No") if max(L)*2 >= sum(L) else print("Yes")

Solution (Python):
n = int(input())
lis = list(map(int, input().split()))

lis.sort()

if lis[-1] < sum(lis[0:n-1]):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
l = sorted(l)
if l[n-1] < sum(l[:n-1]):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int,input().split()))

if max(L) < sum(L) - max(L):
        print("Yes")
else:
        print("No")

Solution (Python):
n = input().strip()
l = list(map(int, input().strip().split(' ')))

max = max(l)
sum = sum(l)

if (sum - max) > max:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
l = list(map(int, input().split(' ')))
l.sort()
if sum(l[:-1]) > l[-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
num_list = list(map(int, input().split()))

max_val = max(num_list)
sum_except_max = sum(num_list) - max_val

if (max_val < sum_except_max):
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
List = [int(l) for l in input().split()]

s = sum(List)
l_max = max(List)
if l_max < s-l_max:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
X = sorted(list(map(int, input().split())))
sum1 = sum(X) - X[-1]

if X[-1] < sum1:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
l = [int(i) for i in input().split()] 
 
if max(l) < sum(l) - max(l):
  print('Yes')
else:
  print('No')

Solution (Python):
def check():
    N = input()
    S = list(map(int, input().split(" ")))
    sum_s = sum(S) - max(S)
    if sum_s > max(S):
        print("Yes")
    else:
        print("No")
check()

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

print('Yes' if max(L) * 2 < sum(L) else 'No')

Solution (Python):
import io, sys

N = int(input())
L = list(map(int, input().split()))

print('Yes' if max(L) * 2 < sum(L) else 'No')

Solution (Python):
import numpy as np
def q52(n, l):
    maxarg = np.argmax(l)
    m = max(l)
    del l[maxarg]
    if m < sum(l):
        return 'Yes'
    else:
        return 'No'

N = int(input())
L = [int(i) for i in input().split()]
print(q52(N, L))

Solution (Python):
n,*a,=map(int,open(0).read().split());print("YNeos"[sum(a)<=max(a)*2::2])

Solution (Python):
n,*a,=map(int,open(0).read().split());a.sort();print("YNeos"[sum(a[:-1])<=a[-1]::2])

Solution (Python):

n = int(input())
L = [int(el) for el in input().split(' ')]

max_l = max(L)
if sum(L) - max_l > max_l:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
s = sum(l)

for i in range(n):
    if s <= 2*l[i]:
        print('No')
        exit()
print('Yes')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
l.sort(reverse=True)
a = l[0]
if a < sum(l[1:]):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = [int(e) for e in input().split()]
if max(l) < sum(l) - max(l):
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
L = [int(i) for i in input().split()]
L.sort()
if L[-1] < sum(L[:N-1]): print("Yes")
else: print("No")

Solution (Python):
n = int(input())
l = [int(i) for i in input().split(" ")]
max_l = max(l)
sum_n_1 = sum(l) - max_l
if max_l < sum_n_1:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
print('Yes' if max(l)<sum(l)-max(l) else 'No')

Solution (Python):
N = int(input())
L = list(map(int,input().split()))

s = 0
maxL = 0

for i in range(N):
    if L[i] > maxL:
        maxL = L[i]
       
    
    s = s+L[i]


if s-maxL  > maxL:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int,input().split()))

L.sort()
s = 0

for i in range(N-1):
    s = s+L[i]

if s  > L[N-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int,input().split()))

maxi = L.index(max(L))
s = 0

for i in range(N):
    s = s+L[i]

if s - L[maxi] > L[maxi]:
    print("Yes")
else:
    print("No")

Solution (Python):

n = input()
l = list(sorted(map(int,input().split())))

print("Yes" if l[-1] < sum(l[0:-1]) else "No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

check = 0

for i in range(N):
    L_tmp = L[i]
    L_sum_tmp = sum(L) - L_tmp
    if L_sum_tmp <= L_tmp:
        check = 1

if check == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
l=list(map(int,input().split()))

l.sort()
if l[n-1]<sum(l)-l[n-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())

l = list(map(int, input().split()))

a = max(l)

s = sum(l) - a

if(a < s):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
L = list(map(int, input().split()))

max = max(L)
if (sum(L)-max > max):
    ans = "Yes"
else:
    ans = "No"

print(ans)

Solution (Python):
N=int(input())
l=list(map(int,input().split()))
x=max(l)
y=sum(l)

if x<(y-x):
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
L.sort()
longest = L[N-1]
other = sum(L[:N-1])
if longest < other:
  print('Yes')
else:
  print('No')

Solution (Python):
a = int(input())
b = list(map(int, input().split()))
b = sorted(b, reverse=True)
if sum(b) - b[0] > b[0]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
l.sort()
print('Yes' if l[-1] * 2 < sum(l) else 'No')

Solution (Python):


N = int(input())

l = list(map(int, input().split()))

m = max(l)
del l[l.index(max(l))]

if sum(l) > m:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))

if (sum(l) - max(l)) > max(l):
    print('Yes')
else:
    print('No')

Solution (Python):
num = int(input())
hen = list(map(int, input().split()))
hen.sort(reverse=True)
long = hen[0]
hen = hen[1:]
if sum(hen) > long:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
L = sorted(list(map(int, input().split())))

if L[-1]< sum(L[0:N-1]):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = sorted(list(map(int, input().split())))

if L[-1] < sum(L[0:N-1]):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
if a[0] < sum(a) -a[0]:
        print("Yes")
else:
        print("No")

Solution (Python):
n=int(input())
x=list(map(int,input().split()))

if 2*max(x)<sum(x):
	print('Yes')
else:
	print('No')

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
L.sort()
if L[-1] < sum(L[:-1]):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())

L = list(map(int,input().split()))

sum = int(0)
a = max(L)

for i in range(n):
  sum += L[i]
  
if 2*a < sum:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
if max(L) < sum(L) - max(L):
    print("Yes")
else:
    print("No")

Solution (Python):


def main():
    N = int(input())
    L = [int(i) for i in input().split()]
    largest = max(L)

    if largest < sum(L)-largest:
        print("Yes")
    else:
        print("No")
    



if __name__== "__main__":
    main()

Solution (Python):
N = int(input())
l = list(map(int, input().split()))
ans = "No"
if max(l) < sum(l) - max(l):
    ans = "Yes"
print(ans)

Solution (Python):
n=int(input())
li=[int(x) for x in input().split()]
long=max(li)
if long< sum(li)-long:
  print("Yes")
else:
  print("No")

Solution (Python):
n=int(input())
l= list(map(int,input().split()))

l_sorted = sorted(l,reverse=True)
if l_sorted[0]<sum(l_sorted[1:]):
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())

L = list(map(int, input().split()))

max_L = max(L)

L.pop(L.index(max_L))

if sum(L) > max_L:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
suml = sum(l)
maxl = max(l)
if sum(l)-max(l)>max(l):
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
L=list(map(int,input().split()))
T=0
for i in range(N):
  T+=L[i]  
if max(L)<T-max(L):
  print("Yes")
else:
  print("No")

Solution (Python):
n=int(input())
a=list(map(int,input().split()))


if max(a)*2 < sum(a):
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
b = list(map(int, input().rstrip().split()))
c = max(b)
d = 0
for i in b:
  d +=i
d -= c
if c < d:
  print("Yes")
else:
  print("No")

Solution (Python):
n=int(input())
lines=list(map(int, input().split()))
max_line=max(lines)
sum=sum(lines) -max_line
if sum > max_line:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
print('Yes' if sum(L)>max(L)*2 else 'No')

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

a.sort()
if a[-1] < sum(a[:n-1]):
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
L=list(map(int,input().split()))
MAX, SUM=0,0
for i in range(N): 
  if MAX<L[i]:
    MAX=L[i]
for i in range(N):
  SUM=SUM+L[i]
if MAX>=SUM-MAX:
  print('No')
else:
  print('Yes')

Solution (Python):
N = int(input())
li = list(map(int,input().split()))
Ma = max(li)
li.remove(Ma)
if Ma >= sum(li):
    print("No")
else:
    print("Yes")

Solution (Python):
N = int(input())
l = [int(x) for x in input().split()]
s = sum(l)

for i in range(N):
    if s - l[i] <= l[i]:
        print("No")
        exit()
print("Yes")

Solution (Python):
n = int(input())
li = list(map(int, input().split()))

if max(li) * 2 < sum(li):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

if max(l) < sum(l) - max(l):
  print('Yes')
else:
  print('No')

Solution (Python):
_ = input()

nums = [int(x) for x in input().split()]

max_ = max(nums)

nums.pop(nums.index(max_))

rest = sum(nums)

if rest > max_:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
if 2*max(l) < sum(l):
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
L= list(map(int, input().split()))
cnt = 0

for i in range(N):
    a = sum(L) - L[i]
    if a > L[i]:
        cnt += 1
    
if cnt == N:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
from collections import deque

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def gcd(a, b):
    if a == 0:
        return b
    if b == 0:
        return a

    if a > b:
        return gcd(b, a % b)
    else:
        return gcd(a, b % a)


def gcd_multi(nums):
    if len(nums) == 0:
        return 0
    if len(nums) == 1:
        return nums[0]

    ret = gcd(nums.pop(), nums.pop())
    while len(nums) > 0:
        ret = gcd(ret, nums.pop())
    return ret


def solve(inputs):
    sides = string_to_int(inputs[0])
    max_i = -1
    for i, s in enumerate(sides):
        if max_i == -1 or s > sides[max_i]:
            max_i = i
    max_len = sides.pop(max_i)

    return "Yes" if max_len < sum(sides) else "No"


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    input()
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
n = int(input())
l = list(map(int, input().split(" ")))
ans = sum(l) - max(l) > max(l)
print("Yes" if ans else "No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

L.sort(key=lambda x:-x)

if L[0] >= sum(L[1::]):
  print('No')
else:
  print('Yes')

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
max_num = max(L)
total_sum = sum(L)
if (total_sum - max_num) > max_num:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
m=max(l)
num=l.index(m)
del l[num]
print("Yes" if m-sum(l)<0 else "No")

Solution (Python):
def main():
    _ = int(input())
    l = sorted(map(int, input().split()))
    if l[-1] < sum(l[:-1]):
        print('Yes')
    else:
        print('No')


main()

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
total=0

for i in range(N):
    total +=A[i]
if max(A)<total-max(A):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
L.sort()
sum = 0
for i in range(0, N-1):
	sum += L[i]
if L[-1] < sum:
	print('Yes')
else:
	print('No')

Solution (Python):



N = int(input())
L = list(map(int, input().split()))


L.sort()
ans = 'Yes' if L[-1] < sum(L[:-1]) else 'No'


print(ans)

Solution (Python):
a = int(input())
b = list(map(int, input().split()))
b.sort()
c = 0
for i in range(len(b)-1):
    c += b[i]
if c > b[len(b)-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

longest = max(L)
if longest < sum(L) - longest:
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
l=list(map(int,input().split()))
l=sorted(l)

if l[-1] < sum(l[:-1]):
  print("Yes")
else:
  print("No")

Solution (Python):
import numpy as np

n = int(input())

l = list(map(int,input().split()))

l.sort()

if np.sum(l[:-1]) > l[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
L = sorted(L)
if L[-1] < sum(L[:-1]):
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
l=list(map(int,input().split()))

s=sum(l)
m=max(l)
ans='Yes' if s>m*2 else 'No'
print(ans)

Solution (Python):
N=int(input())
L=list(map(int,input().split()))
L.sort()
if sum(L[:N-1])>L[N-1]:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

if max(l)*2 < sum(l):
    print("Yes")
else:
    print("No")

Solution (Python):
input()
line = list(map(int,input().split()))
print("Yes" if max(line) < sum(line) - max(line) else "No")