N=int(input())
D=list(map(int,input().split()))
inf=1<<30
dp=[-inf]*(1<<N)
dp[0]=100
for bit in range(1<<N):
    c=1
    for i in range(N):
        if bit&1<<i and D[i]<0:
            c+=1
    for i in range(N):
        if not bit&1<<i:
            continue
        if D[i]>0:
            dp[bit]=max(dp[bit],min(dp[bit^1<<i]+D[i],c*100))
        else:
            if dp[bit^1<<i]+D[i]>0:
                dp[bit]=max(dp[bit],dp[bit^1<<i]+D[i])
ans=dp[-1]
if ans<-inf//2:
    ans=0
print(ans)