n = int(input())
M = [int(input()) for i in range(n)]

INF = 10**18
dp = [INF]*(1<<n)
dp[0] = 0
for s in range(1<<n):
    d = 0
    for i in range(n):
        if (s>>i)&1:
            d += M[i]
    d %= 1000
    for i in range(n):
        if (s>>i)&1:
            continue
        ns = s|(1<<i)
        dp[ns] = min(dp[ns], dp[s]+max(0, M[i]-d))
print(dp[-1])