N = int(input())
D = tuple(map(int, input().split()))
INF = 10 ** 9
dp = [[-INF] * (1 << N) for _ in range(N + 1)]
dp[1][0] = 100
for b in range(1 << N):
    for i, d in enumerate(D):
        if (b >> i) & 1:
            continue
        c = b | (1 << i)
        if d > 0:
            for level in range(N + 1):
                dp[level][c] = max(dp[level][c], min(dp[level][b] + d, level * 100))
        else:
            for level in range(N):
                if dp[level][b] + d > 0:
                    dp[level + 1][c] = max(dp[level + 1][c], dp[level][b] + d)

ans = max(dp[level][-1] for level in range(N + 1))
if ans < 0:
    ans = 0
print(ans)