N=int(raw_input())
M=[int(raw_input()) for i in range(N)]
dp=[1500000 for i in range(1<<N)]
S=[]
for i in range(1<<N):
    s=0
    for j in range(N):
        if (i&(1<<j))>0:
            s+=M[j]
    S.append(s%1000)

def bitCount(c):
    ret=0
    while c!=0:
        c&=c-1
        ret+=1
    return ret

dp[0]=0
for i in range(N):
    for j in range(1<<N):
        if bitCount(j)==i:
            for k in range(N):
                if (j&(1<<k))==0:
                    dp[j|(1<<k)]=min(dp[j|(1<<k)],dp[j]+max(0,M[k]-S[j]))
print dp[(1<<N)-1]