#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;

int main() {
    int n;
    cin >> n;
    vi dp(1 << n, 1e9);
    dp[0] = 0;

    vi ps(n);
    for (int i = 0; i < n; i++) {
        cin >> ps[i];
    }

    for (int i = 0; i < 1 << n; i++) {
        for (int j = 0; j < n; j++) {
            if ((i >> j) & 1) continue;
            int sum = 0;
            for (int k = 0; k < n; k++) {
                if ((i >> k) & 1) {
                    sum += ps[k];
                }
            }
            dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + max(0l, ps[j] - sum % 1000));
        }
    }
    // for (int i = 0; i < 1 << n; i++) {
    //     cout << bitset<3>(i).to_string() << " " << dp[i] << endl;
    // }
    cout << dp[(1 << n) - 1] << endl;
}