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

DP = [0 for _ in range(1 << n)]
DP[0] = 100
for bit in range(1 << n):
    if DP[bit] == 0:
        continue
    res = DP[bit]
    max_ = 100
    seen = set()
    for i in range(n):
        if (bit >> i) & 1:
            seen.add(i)
            if D[i] < 0:
                max_ += 100
    for i in range(n):
        if i in seen:
            continue
        nbit = bit | (1 << i)
        DP[nbit] = max(DP[nbit], min(max_, DP[bit] + D[i]))
print(DP[-1])