n = int(input())
D = list(map(int, input().split()))
bad = set()
for i, d in enumerate(D):
    if d < 0:
        bad.add(i)
INF = 10**18
dp = [-INF]*(1<<n)
dp[0] = 100
for s in range(1<<n):
    maxh = 100
    for i in bad:
        if (s>>i)&1:
            maxh += 100
    for i in range(n):
        if (s>>i) & 1:
            continue
        ns = s|(1<<i)
        if D[i] >= 0:
            dp[ns] = max(dp[ns], min(maxh, dp[s]+D[i]))
        else:
            if dp[s]+D[i] <= 0:
                continue
            else:
                dp[ns] = max(dp[ns], dp[s]+D[i])
if dp[-1] <= 0:
    print(0)
else:
    print(dp[-1])