N = int(input())
M = [int(input()) for _ in range(N)]
dp = [10**18]*(1<<N)
dp[0] = 0

for S in range(1<<N):
    c = 0
    
    for i in range(N):
        if (S>>i)&1:
            c += M[i]
    
    bonus = c%1000
    
    for i in range(N):
        if not (S>>i)&1:
            dp[S|(1<<i)] = min(dp[S|(1<<i)], dp[S]+max(0, M[i]-bonus))

print(dp[-1])