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


healer_mask = 0
enemy_mask = 0
for i, d in enumerate(D):
    if d > 0:
        healer_mask |= 1 << i
    else:
        enemy_mask |= 1 << i

dp = [0] * (1 << N)
dp[0] = 100
for i in range(1 << N):
    if dp[i] == 0: continue

    for j in range(N):
        if i & (1 << j): continue
        ni = i | (1 << j)
        if D[j] > 0:  # 回復
            maxhp = 100 * ((i & enemy_mask).bit_count() + 1)
            dp[ni] = max(dp[ni], min(maxhp, dp[i] + D[j]))
        else:
            dp[ni] = max(dp[ni], max(0, dp[i] - abs(D[j])))


ans = 0
for i in range(1 << N):
    if (i & enemy_mask) != enemy_mask: continue
    ans = max(ans, dp[i])

print(ans)