#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>P;
typedef vector<int>VI;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define maxv(a,b) (a)=max((a),(b))
#define minv(a,b) (a)=min((a),(b))
const int INF=1001001001;

int N;
VI A;

int dp[1<<16];
int main(){
    scanf("%d",&N);
    A.resize(N);
    rep(i,N)scanf("%d",&A[i]);

    fill_n(dp,1<<N,INF);
    dp[0]=0;

    rep(i,1<<N){
        int sum=0;
        rep(j,N)if(i>>j&1)sum+=A[j];
        sum%=1000;
        rep(j,N){
            if(i>>j&1)continue;
            minv(dp[i|(1<<j)],dp[i]+max(0,A[j]-sum));
        }
    }

    printf("%d\n",dp[(1<<N)-1]);

    return 0;
}