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

discount = [0] * (1 << N)
for bit in range(1 << N):
    for i in range(N):
        if (bit >> i) & 1:
            discount[bit] += M[i]
    discount[bit] %= 1000

inf = 10**18
dp = [inf] * (1 << N)
dp[0] = 0
for bit in range((1 << N) - 1):
    for i in range(N):
        if ~(bit >> i) & 1:
            bit_next = bit | (1 << i)
            cost = max(0, M[i] - discount[bit])
            dp[bit_next] = min(dp[bit_next], dp[bit] + cost)
            
print(dp[(1 << N) - 1])