#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,N) for(int i=0;i<(N);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int N;cin>>N;
    vector<ll> M(N);
    cin>>M;

    vector<ll> P(1<<N,0);
    rep(i,1<<N){
        rep(j,N){
            if((i>>j)&1) P[i]+=M[j];
        }
    }

    vector<ll> dp(1<<N,LINF);
    dp[0]=0;
    for(int bit=0;bit<(1<<N);bit++){
        rep(i,N)if(!((bit>>i)&1)){
            chmin(dp[bit|(1<<i)],dp[bit]+max(0ll,M[i]-P[bit]%1000));
        }
    }
    cout<<dp[(1<<N)-1]<<endl;
    return 0;
}