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

A=[]
B=[]

DP=[-1]*(1<<N)
DP[0]=100

for i in range(1<<N):
    now=DP[i]
    if now==-1:
        continue

    MAX=100

    for j in range(N):
        if i & (1<<j) != 0 and D[j]<0:
            MAX+=100

    for j in range(N):
        if i & (1<<j) == 0:
            if D[j]>0:
                DP[i|(1<<j)]=max(DP[i|(1<<j)],min(MAX,DP[i]+D[j]))
            else:
                if DP[i]+D[j]<=0:
                    continue
                else:
                    DP[i|(1<<j)]=max(DP[i|(1<<j)],DP[i]+D[j])

print(max(0,DP[-1]))