from collections import *
inf=10**16
n = int(input())
mm =[int(input()) for _ in range(n)] 
dp=[inf]*(1<<n)
dp[0] = 0
for bit in range(1<<n):
    pre=dp[bit]
    for i in range(n):
        if bit>>i&1:continue
        nbit=bit|1<<i
        t1 = [mm[j] for j in range(n) if bit>>j&1]
        t = sum(t1)%1000
        price=max(0,mm[i]-t)
        dp[nbit]=min(dp[nbit],dp[bit]+price)
print(dp[-1])