N=int(input())
D=list(map(int,input().split()))
MAX=1<<N
dp=[[0 for _ in range(N)] for _ in range(MAX)]
for i in range(N):dp[1<<i][i]=max(0,min(100,100+D[i]))
for s in range(1,MAX):
    for frm in range(N):
        if s&(1<<frm)==0:continue
        for to in range(N):
            if s&(1<<to)==0:continue
            bs=s^(1<<to)
            if dp[bs][frm]==0:continue
            level=1
            for i in range(N):
                if bs&(1<<i)>0 and D[i]<0:level+=1
            if D[to]<0:dp[s][to]=max(dp[s][to],dp[bs][frm]+D[to])
            else:dp[s][to]=max(dp[s][to],min(level*100,dp[bs][frm]+D[to]))
ans=max(dp[-1])
print(ans)