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

#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
   int paSize = printArray.size();
   for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
   if (between != '\n') {cerr << endl;}
}

// ------------------------------------------------------------------------------------------

const int INF = 1 << 28;

int dp[1<<15], price[15];

int main() {
   int N;
   cin >> N;
   rep (i, N) cin >> price[i];
   fill(dp, dp + (1<<N), INF);
   dp[0] = 0;

   for (int bit = 0; bit < (1<<N); bit++) {
      // i個目を新たに買う操作を行う
      for (int i = 0; i < N; i++) {
         if (!((bit >> i) & 1)) continue; // i立ってたらはじく
         int pbit = bit - (1 << i);

         // i以外でビットが立っているものの値段の総和
         int sum = 0;
         for (int j = 0; j < N; j++) {
            if ((bit >> j) & 1) {
               if (i == j) continue;
               sum += price[j];
            }
         }
         int discount = sum % 1000;
         dp[bit] = min(dp[bit], dp[pbit] + max(0, price[i] - discount));
      }
   }

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

   return 0;
}