N = input()
M = [input() for i in [1]*N]

INF = 100000000


dp = [INF] * (1<<N)
nyrn = [0] * (1<<N)
for i in range(N):
    dp[1<<i] = M[i]
    nyrn[1<<i] = M[i]

for i in range(1<<N):
    nyrn[i] = sum([nyrn[1<<j] if i&1<<j else 0 for j in range(N)] )

for i in range(1<<N):
    
    for j in range(N):
        if not(1<<j & i):
            p = 1<<j | i
            pr = dp[1<<j] - nyrn[i]%1000
            pr = pr if pr > 0 else 0
            dp[p] = min(dp[p],dp[i] + pr)
print dp[(1<<N)-1]