#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
  bitDP
*/

int dp[1<<15];

int main()
{
  int n;
  cin >> n;

  vi a(n);
  rep(i, n) cin >> a[i];

  rep(i, 1<<n) dp[i] = inf;
  dp[0] = 0;

  rep(mask, 1<<n){
    int dis = 0;
    rep(i, n){
      if(mask & 1<<i) dis += a[i];
    }
    dis %= 1000;

    rep(i, n){
      if(!(mask & 1<<i)){
        dp[mask | 1<<i] = min(dp[mask | 1<<i], dp[mask] + max(0, a[i] - dis));
      }
    }
  }

  cout << dp[(1<<n)-1] << endl;

  return 0;
}