#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    long long N, M, S;
    cin >> N;
    M = 1<<N;
    vector<long long> v(N), off(M), dp(M, 1e18);
    for (int i=0; i<N; i++) cin >> v[i];
    for (int i=0; i<M; i++){
        S = 0;
        for (int j=0; j<N; j++){
            if (i & 1<<j){
                S += v[j];
                S %= 1000;
            }
        }
        off[i] = S;
    }

    dp[0] = 0;
    for (int i=0; i<M; i++){
        for (int j=0; j<N; j++){
            if (!(i & 1<<j)) dp[i|1<<j] = min(dp[i|1<<j], dp[i]+max(0LL, v[j]-off[i]));
        }
    }

    cout << dp[M-1] << endl;

    return 0;
}