from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
M = [int(input()) for _ in range(N)]
mod = 1000

INF = (1<<60)
dp = [INF]*(1<<N)
S = [0]*(1<<N)

for i in range(1<<N):
    
    for j in range(N):
        if (i>>j)&1:
            S[i] += M[j]

dp[0]=0
for i in range(1<<N):
    
    target = []
    for j in range(N):
        if (i>>j)&1:
            continue
        target.append(j)
        
    for t in target:
        
        dp[i|(1<<t)] = min(dp[i|(1<<t)],dp[i] + max(0,M[t] - S[i]%1000))
print(dp[-1])