N = int(input())
M = [int(input()) for _ in range(N)]
MOD = 1000
MAX = 150000

dp = [MAX] * (1 << N)
dp[0] = 0
for b in range(1, 1 << N):
    S = sum(M[i] * ((b >> i) & 1) for i in range(N))
    for i in range(N):
        if (b >> i) & 1:
            dp[b] = min(dp[b], dp[b - (1 << i)] + max(M[i] - ((S - M[i]) % MOD), 0))
print(dp[-1])