#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)


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

    dp = [0] * (1<<N)
    dp[0] = 100
    for s in range(1<<N):
        if dp[s] == 0:
            continue
        for i in range(N):
            if s & (1<<i):
                continue
            s1 = s | (1<<i)
            if D[i] > 0:
                max_hp = 100 + sum(100 for j in range(N) if D[j] < 0 and s & (1<<j))
                hp1 = min(dp[s] + D[i], max_hp)
                dp[s1] = max(dp[s1], hp1)
            else:
                hp1 = dp[s] + D[i]
                if hp1 > 0:
                    dp[s1] = max(dp[s1], hp1)
    ans = dp[(1<<N)-1]
    print(ans)

if __name__ == '__main__':
    main()