N = int(input())
D = list(map(int, input().split()))
dp = [-float('inf')]*(1<<N)
dp[0] = 100

for i in range(1<<N):
    max_hp = 100
    
    for j in range(N):
        if (i>>j)&1 and D[j]<0:
            max_hp += 100
            
    for j in range(N):
        if not (i>>j)&1:
            if D[j]>0:
                dp[i|(1<<j)] = max(dp[i|(1<<j)], min(dp[i]+D[j], max_hp))
            else:
                if dp[i]+D[j]>0:
                    dp[i|(1<<j)] = max(dp[i|(1<<j)], dp[i]+D[j])

if dp[-1]==-float('inf'):
    print(0)
else:
    print(dp[-1])