#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
const int inf=1e9;

int v[15];
int dp[1<<15];
int main() {
    int n;
    cin>>n;
    REP(i,0,n){
        cin>>v[i];
    }
    REP(mask,0,1<<n) dp[mask] = inf;
    dp[0]=0;
    REP(mask,0,1<<n){
        int sum=0;
        REP(i,0,n){
            if((mask & (1<<i))) sum += v[i];
        }
        REP(i,0,n){
            if((mask & (1<<i))) continue;
            dp[mask | (1<<i)] = min(dp[mask|(1<<i)], dp[mask] + max(0, v[i] - sum%1000));
        }
    }
    p(dp[(1<<n)-1]);
    return 0;
}