N = int(input())
D = list(map(int, input().split()))

mask = 0
for i in range(N):
    if D[i] < 0:
        mask = mask | (1<<i)

dp = [-float('inf') for _ in range(1<<N)]
dp[0] = 100

for i in range(1<<N):
    for j in range(N):
        if i & (1<<j):
            k = i & ~(1<<j)
            if 0 < dp[k] + D[j]:
                dp[i] = max(dp[i], dp[k] + D[j])
    upper = 100 * (1 + bin(i & mask).count('1'))
    dp[i] = min(dp[i], upper)

print(max(dp[(1<<N)-1],0))