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

INF = float('inf')
max_mask = 1 << n
dp = [[INF] * 1000 for _ in range(max_mask)]
dp[0][0] = 0

for mask in range(max_mask):
    for current_mod in range(1000):
        if dp[mask][current_mod] == INF:
            continue
        for i in range(n):
            if not (mask & (1 << i)):
                new_mask = mask | (1 << i)
                cost = max(0, m[i] - current_mod)
                next_mod = (current_mod + m[i]) % 1000
                if dp[new_mask][next_mod] > dp[mask][current_mod] + cost:
                    dp[new_mask][next_mod] = dp[mask][current_mod] + cost

final_mask = (1 << n) - 1
result = min(dp[final_mask][mod] for mod in range(1000))

print(result)