N=int(raw_input())
D=map(int,raw_input().split())
dp=[0 for i in range(1<<N)]
dp[0]=100
for i in range(1<<N):
    if dp[i]<=0:
        continue
    power=100
    for j in range(N):
        if i&(1<<j) !=0 and D[j]<0:
            power+=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(power,dp[i]+D[j]))
            else:
                dp[i|(1<<j)]=max(dp[i|(1<<j)],dp[i]+D[j])
print dp[(1<<N)-1]