#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 16;
const int INF = 1e9;
int M[MAXN];
int dp[1<<MAXN];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) cin >> M[i];
    for (int i = 0; i < 1<<N; i++) dp[i] = INF;
    dp[0] = 0;
    for (int s = 0; s < 1<<N; s++) {
        if (dp[s] == INF) continue;
        int sum = 0;
        for (int i = 0; i < N; i++) if ((s>>i)&1) sum += M[i];
        sum %= 1000;
        for (int i = 0; i < N; i++) {
            if ((s>>i)&1) continue;
            int ns = s|1<<i;
            int now = M[i]-sum;
            now = max(now, 0);
            dp[ns] = min(dp[ns], dp[s] + now);
        }
    }
    cout << dp[(1<<N)-1] << endl;
    return 0;
}