#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <functional>
#include <tuple>
#include <climits>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <iomanip>

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int> M(N);
    for(auto &m : M) cin >> m;
    vector<int> dp(1<<N, numeric_limits<int>::max());
    dp[0] = 0;
    for(int i=0; i<(1<<N)-1; i++) {
        int total = 0;
        for(int j=0; j<N; j++)
            total += (i&(1<<j))!=0?M[j]:0;
        total %= 1000;
        for(int j=0; j<N; j++) {
            if((i&(1<<j)) == 0) {
                int a = dp[i] + std::max(0, M[j]-total);
                dp[i | (1<<j)] = std::min(dp[i | (1<<j)], a);
            }
        }
    }
    cout << dp[(1<<N) - 1] << endl;
}