#include <bits/stdc++.h>
using namespace std;

#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)

#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()

typedef long long ll;
const int INF   = 1e9;
const ll  INFLL = 1e18;
typedef pair<int, int> PII;
int dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};

const int MOD = 1000;
int dp[1<<15][1000];

int main()
{
    ios::sync_with_stdio(false);
    int N; cin >> N;

    fill(dp[0], dp[0] + (1<<15) * 1000, INF);
    dp[0][0] = 0;

    vector<int> M(N);
    int sum = 0;
    rep(i, N) { cin >> M[i]; sum += M[i]; }
    
    for (int i=0; i<(1<<N); i++) {
        for (int j=0; j<1000; j++) {
            for (int n=0; n<N; n++) {
                if (dp[i][j] < INF && !((i>>n)&1)) {
                    int m = M[n];
                    dp[i|(1<<n)][(j+m)%MOD] = min(dp[i|(1<<n)][(j+m)%MOD], dp[i][j] + max(0, m - j));
#ifdef DEBUG
                    // DUMP(BINARY(i));
                    // cerr << BINARY((i|(1<<n))) << endl;
                    // DUMP(j);
#endif
                }
            }
        }
    }

    // int ans = INF;
    // for (int j=0; j<=1000; j++) ans = min(ans, dp[(1<<N)-1][j]);
    cout << dp[(1<<N) - 1][sum%MOD] << endl;
}