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

#define REP(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<30)
#define INFLL (1LL<<62LL)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};

int N;
int M[15];
int dp[16][1<<15];

int calc_discount(int goods) {
  int ret = 0;
  rep(i, 15) {
    if (!(goods & (1 << i))) continue;
    ret += M[i];
  }
  ret %= 1000;
  return ret;
}

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> N;
  rep(i, N) cin >> M[i];

  rep(i, N + 1) rep(j, 1 << N) dp[i][j] = INF;
  dp[0][0] = 0;

  REP(i, 1, N + 1) {
    rep(j, 1 << N) {
      if (__builtin_popcount(j) != i - 1)
        continue;

      int discount = calc_discount(j);
      rep(k, 15) {
        // already bought
        if (j & (1 << k)) continue;

        int price = max(0, M[k] - discount);
        dp[i][j|(1<<k)] = min(dp[i][j|(1<<k)], dp[i-1][j] + price);
      }
    }
  }

  cout << dp[N][(1<<N)-1] << endl;
  return 0;
}