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

INF = 10**18
DP = [INF for _ in range(1 << n)]
DP[0] = 0
for bit in range((1 << n) - 1):
    res = 0
    for i in range(n):
        if (bit >> i) & 1:
            res += M[i]
            res %= 1000
    for i in range(n):
        if (bit >> i) & 1:
            continue
        nbit = bit | (1 << i)
        DP[nbit] = min(DP[nbit], DP[bit] + max(M[i] - res, 0))
print(DP[-1])