N=int(input())
D=list(map(int,input().split()))
MAX=1<<N
dp=[[[0,100] for _ in range(N)] for _ in range(MAX)]
for i in range(N):
    if D[i]<0:dp[1<<i][i]=[100+D[i],200]
    else:dp[1<<i][i]=[100,100]

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]<=0:continue
            if D[to]<0:
                if dp[bs][frm][0]+D[to]>dp[s][to][0]:
                    dp[s][to][0]=dp[bs][frm][0]+D[to]
                    dp[s][to][1]=dp[bs][frm][1]+100
            else:
                mx=dp[bs][frm][1]
                if min(mx,dp[bs][frm][0]+D[to])>dp[s][to][0]:
                    dp[s][to][0]=min(mx,dp[bs][frm][0]+D[to])
                    dp[s][to][1]=dp[bs][frm][1]
ans=0
for i in range(N):ans=max(ans,dp[-1][i][0])
print(ans)