#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        os << "[" << vs[0];
        for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    const int INF = INT_MAX / 4;

    int N;
    vector<int> M;
    void input() {
        cin >> N;
        M.clear(); M.resize(N);
        cin >> M;
    }

    void solve() {
        vector<int> dp(1 << N, INF);
        vector<int> S(1<<N, 0);
        for (int i = 0; i < (1<<N); i++) {
            int s = 0;
            for (int j = 0; j < N; j++) {
                if (i & (1 << j)) {
                    s += M[j];
                }
            }
            S[i] = s;
        }
        dp[0] = 0;
        for (int j = 0; j < (1 << N); j++) {
            for (int i = 0; i < N; i++) {
                if (j & (1 << i)) continue;
                dp[j | (1 << i)] = min(dp[j | (1 << i)], dp[j] + max(0, M[i] - (S[j] % 1000)));
            }
        }
        cout << dp[(1<<N) - 1] << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}