n = int(input())
D = list(map(int, input().split()))
dp = [-1 << 30] * (1 << n)
dp[0] = 100
for bit in range(1 << n):
    ma = 100
    for i in range(n):
        if bit >> i & 1:
            if D[i] < 0:
                ma += 100
    for i in range(n):
        if not bit >> i & 1:
            nbit = bit | (1 << i)
            if D[i] < 0:
                if dp[bit] + D[i] > 0:
                    dp[nbit] = max(dp[nbit], dp[bit] + D[i])
            else:
                dp[nbit] = max(dp[nbit], min(dp[bit] + D[i], ma))
ans = dp[-1]
print(max(ans, 0))