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

HP = [100] * (1 << N)
for S in range(1 << N):
    for i, d in enumerate(D):
        if (S >> i) & 1 and d < 0:
            HP[S] += 100


# S: 今まで出会ったモンスターの集合、その時の体力の最大値
dp = [0] * (1 << N)
dp[0] = 100
for S in range(1 << N):
    # print(bin(S)[2:].zfill(N), dp[S])
    if dp[S] <= 0:
        continue
    for i, d in enumerate(D):
        if ~(S >> i) & 1:
            T = S ^ (1 << i)
            if d > 0:
                dp[T] = max(dp[T], min(HP[S], dp[S] + d))
            else:
                dp[T] = max(dp[T], dp[S] + d)

print(dp[(1 << N)-1])