N = int(raw_input())
D = map(int,raw_input().split())
bad = sum(1 << i for i in xrange(N) if D[i] < 0)
    
dp = [0]*(1 << N)
dp[0] = 100
for bit in xrange(1 << N):
    for i in xrange(N):
        if dp[bit] == 0 or bit & (1 << i): continue
        beat = bin(bad & bit).count("1")
        dp[bit | 1 << i] = max(dp[bit | 1 << i], min(100*(beat+1), dp[bit]+D[i]))
print dp[(1 << N)-1]