import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    D = LI()
    DP = [0 for _ in range(2 ** N)]
    DP[0] = 100
    for S in range(2 ** N):
        if DP[S] == 0:continue
        hp = 1
        for s in range(N):
            if S >> s & 1 and D[s] <0:
                hp += 1
        MaxHP = hp*100
        for t in range(N):
            if S >> t & 1:
                continue
            if D[t] > 0:
                DP[S|1<<t] = max(DP[S|1 << t],min(DP[S] + D[t],MaxHP))
            else:
                if DP[S]+D[t] <0:
                    continue
                else:
                    DP[S|1<<t] = max(DP[S]+D[t],DP[S|1<<t])
        #print(DP)
    print(DP[S])
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！