#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF=(1LL<<60);
ll calc(vector<ll>&A,ll bit,ll N){
    ll sum = 0;
    for (ll i = 0; i < N; i++)
    {
        if((1<<i)&bit)
            sum += A[i];
    }
   ll res=sum%1000;
    return res;
}
int main(){
    ll N;cin>>N;
    vector<ll>A(N),dp((1<<N),INF);
    dp[0] = 0;
    for (ll i = 0; i < N; i++)
        cin >> A[i];
    for (ll bit = 0; bit < (1LL << N);bit++){
        for (ll i = 0;i<N;i++){
            if(!((1<<i)&bit)){
                dp[(1 << i) + bit] = min(dp[(1 << i) + bit], dp[bit]+max(A[i] - calc(A, bit, N),0LL));
            }
        }
    }
    cout << dp[(1 << N) - 1] << endl;
}