#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <cassert>
#include <cmath>
#include <bitset>
using namespace std;

int n;
int m[20];
int p[20000];
int dp[20000];

void chmin(int &a, int b) {
  a = min(a, b);
}

int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> m[i];

  for (int s = 0; s < (1<<n); s++)
    for (int i = 0; i < n; i++)
      if (!(s&(1<<i)))
        p[s+(1<<i)] = p[s] + m[i];

  for (int s = 0; s < (1<<n); s++) dp[s] = 1000000000;
  dp[0] = 0;

  for (int s = 0; s < (1<<n); s++)
    for (int i = 0; i < n; i++)
      if (!(s&(1<<i)))
        chmin(dp[s+(1<<i)], dp[s] + max(0, m[i] - p[s]%1000));
  
  cout << dp[(1<<n)-1] << endl;

}