#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cassert>

#include <unordered_set>
#include <unordered_map>
#include <random>
#include <thread>
#include <chrono>

using namespace std;

#define int long long
#define let const auto
#define var auto

#define all(c) c.begin(), c.end()
#define repeat(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x) 
#endif

typedef complex<double> point;

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for(int i=0;i<vec.size();i++){
        if(i != 0) os << ",";
        os << vec[i];
    }
    return os << "}";
}
template<typename T>
void isort(std::vector<T>& v, std::function<bool(T,T)> comp=less<T>()){
    sort(v.begin(), v.end(), comp);
}
template<typename T>
std::vector<T> sort(std::vector<T> v, std::function<bool(T,T)> comp=less<T>()){
    isort(v);
    return v;
}
template<typename T>
std::vector<T>& imap(std::vector<T>& v, std::function<T(T)> f){
    for(auto& i: v) i = f(i);
    return v;
}
template<typename T1, typename T2>
std::vector<T2> rmap(const std::vector<T1>& v, std::function<T2(T1)> f){
    std::vector<T2> t; t.reserve(v.size());
    for(const auto& i: v) t.push_back(f(i));
    return t;
}

long long ipow(long long n, long long x){
    if(x == 1) return n;
    else if(x % 2 == 1) return n * ipow(n*n,x/2);
    else return ipow(n*n,x/2);
}

int solve(vector<int> m){
    int n = m.size();
    vector<int> dp(ipow(2,n),1l << 60);
    dp[0] = 0;

    auto teika = [&](int b){
        int r = 0;
        for(int i=0;i<n;i++){
            if(b & (1 << i))
                r += m[i];
        }
        return r;
    };
    for(int s=0;s<ipow(2,n);s++){
        for(int i=0;i<n;i++){
            if((s & (1 << i)) != 0) continue;
            int mod = teika(s) % 1000;
            int nex = s | (1 << i);
            dp[nex] = min(dp[nex], dp[s] + max(0ll, m[i] - mod));
        }
    }
    return dp.back();
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    vector<int> m(n);
    for(int& i: m) cin >> i;

    cout << solve(m) << endl;
    return 0;
}