N = int(raw_input())
M = [int(raw_input()) for _ in xrange(N)]
s = [0 for _ in xrange(1<<N)]
for i in xrange(1 << N):
	for j in xrange(N):
		if (i >> j) & 1: s[i]+= M[j]
	s[i]%=1000

INF = int(1e9+7)
dp = [INF for i in xrange(1<<N)]
dp[0]=0

for i in xrange(1 << N):
	for j in xrange(N):
		if not (i >> j) & 1:
			dp[i|1<<j] = min(dp[i|1<<j], dp[i]+max(0, M[j]-s[i]))

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