INF = 1 << 60

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

dp = [[INF for _ in range(n)] for _ in range(1 << n)]
for src in range(n):
  dp[0][src] = 0

for mask in range(1 << n):
  dpm = dp[mask]

  cnt = 0
  for v in range(n):
    if (mask >> v) & 1 != 0:
      cnt = (cnt + m[v]) % 1000

  for cur in range(n):
    if dpm[cur] == INF:
      continue

    for nxt in range(n):
      if (mask >> nxt) & 1 != 0:
        continue

      dp[mask | (1 << nxt)][nxt] = min(dp[mask | (1 << nxt)][nxt], dpm[cur] + max(0, m[nxt] - cnt))

print(min(dp[-1]))