#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000

typedef long long ll;

int dp[1<<15];
int m[15];
int n;

int solve(int x) {
    int i, j;
    if (dp[x] >= 0)
        return dp[x];
    rep (i,n) {
        if (x & 1<<i) {
            int rest = x ^ 1<<i;
            int sum = 0;
            rep (j,n) {
                if (rest & 1<<j)
                    sum += m[j];
            }
            dp[x] = max(dp[x],solve(rest)+min(m[i],sum%1000));
        }
    }
    return dp[x];
}

int main() {
    int i;
    cin >> n;
    rep (i,n) cin >> m[i];
    fill(dp+1,dp+(1<<n),-1);
    cout << accumulate(m,m+n,0) - solve((1<<n)-1) << endl;
    return 0;
}