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

dp = [[10**10] * 2 for i in range(1 << n)]
for i in range(1 << n):
    dp[i][0] = 0

#購入済み商品の集合を表す
for i in range(1 << n):
    for j in range(n):
        #商品jが購入済み
        if (i >> j) % 2 == 1:
            continue

        #商品jが未購入
        if dp[i][0] == 0:
            dp[i | (1 << j)][0] = m[j]
            dp[i | (1 << j)][1] = m[j]
        else:
            dp[i | (1 << j)][0] = dp[i][0] + m[j]
            dp[i | (1 << j)][1] = min(dp[i | (1 << j)][1], dp[i][1] + max(0, m[j] - (dp[i][0] % 1000)))

print(dp[(1 << n) - 1][1])