import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


def popcount(n):
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c


N = I()
D = LI()

dp = [0]*(1<<N)  # 残り体力の最大値
dp[0] = 100
for i in range(1,1<<N):
    b = 100  # 最大体力
    for j in range(N):
        if (i>>j) & 1 and D[j] < 0:
            b += 100
    a = 0
    for j in range(N):
        if (i>>j) & 1:
            d = D[j]
            x = dp[i^(1<<j)]
            if x == 0:
                continue
            if d > 0:
                a = max(a,min(x+d,b))
            else:
                a = max(a,x+d)
    dp[i] = a

print(dp[-1])