#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define repi(i, ini, N) for(int i = ini; i < N; i++)
#define chmax(i, j) i = max(i, j)
#define chmin(i, j) i = min(i, j)
typedef long long ll;

int N;
ll dp[1<<15];
ll M[15];
const ll INF = 1<<29;

int main() {
  cin >> N;
  rep(i, N) cin >> M[i];
  rep(msk, 1<<N) dp[msk] = INF;
  dp[0] = 0;
  rep(msk, 1<<N) {
    rep(nxt, N) if (!(msk & (1<<nxt))) {
      ll tmp = 0;
      rep(j, N) if (msk & (1<<j)) tmp += M[j];
      tmp = tmp % 1000;
      chmin(dp[msk+(1<<nxt)], dp[msk]+max(M[nxt]-tmp,(ll)0));
    }
  }
  cout << dp[(1<<N)-1] << endl;
}