N=int(input())
M=[]
for _ in range(N):M.append(int(input()))
MAX=1<<N
INF=int(1e18)
dp=[[INF for _ in range(N)] for _ in range(MAX)]
for i in range(N):dp[1<<i][i]=M[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]==INF:continue
            total=0
            for i in range(N):
                if bs&(1<<i)>0:total+=M[i]
            cost=max(0,M[to]-(total%1000))
            dp[s][to]=min(dp[s][to],dp[bs][frm]+cost)
ans=min(dp[-1])
print(ans)