#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
typedef long long ll;

using namespace std;

int inputValue(){
    int a;
    cin >> a;
    return a;
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << fixed << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

// end of template

int dp[1 << 15];

int main() {
    // source code
    
    int N = inputValue();
    vector<int> M(N);
    rep(i, N){
        M[i] = inputValue();
    }
    
    rep(i, 1 << N){
        dp[i] = inf;
    }
    
    dp[0] = 0;
    
    rep(m, 1 << N){
        int sum = 0;
        rep(i, N){
            if (m & (1 << i)) {
                sum = (sum + M[i]) % 1000;
            }
        }
        rep(i, N){
            if ((m & (1 << i)) == 0) {
                dp[m | (1 << i)] = min(dp[m | (1 << i)], dp[m] + ((M[i] - sum) >= 0 ? M[i] - sum : 0));
            }
        }
    }
    
    output(dp[(1 << N) - 1], 0);
    
    return 0;
}