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

for i in range(1<<n):
    if dp[i] < 0:
        continue

    num = 0
    for j in range(n):
        if i >> j & 1 and D[j] < 0:
            num += 1
    for j in range(n):
        if i >> j & 1:
            continue
        d = D[j]
        
        if d < 0:
            if d+dp[i] > 0:
                dp[i|1<<j] = max(dp[i|1<<j],dp[i]+d)
        else:
            hp = min(dp[i]+d,100*(num+1))
            dp[i|1<<j] = max(dp[i|1<<j],hp)
print(max(dp[-1],0))