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

N2 = 1 << N
dp = [0] * N2
dp[0] = 100
for s in range(N2):
    if dp[s] == 0:
        continue
    ma = 100
    for i in range(N):
        if ((s >> i) & 1) and D[i] < 0:
            ma += 100
    for i in range(N):
        if (s >> i) & 1:
            continue
        nex = s | (1 << i)
        dp[nex] = max(dp[nex], min(ma, dp[s] + D[i]))

print(dp[-1])