N = int(input())
M = [int(input()) for i in range(N)]
dp = [[-1] * (1 << N)] * (15 * 100000 + 1)
def dfs(bit,m):
	if bit == (1 << N) - 1:
		return 0
	if dp[m][bit] != -1:
		return dp[m][bit]
	ret = 10 ** 9 + 7
	for i in range(N):
		if (bit >> i) & 1:
			continue
		ret = min(ret,dfs(bit | (1 << i),m + M[i]) + max(0,M[i] - m % 1000))
	dp[m][bit] = ret
	return ret
res = dfs(0,0)
print(res)