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

int main(){
    int n;
    cin>>n;
    vector<ll> dp(1<<n,1e12);
    dp[0] = 0;
    vector<ll> m(n);
    for(int i = 0;i<n;i++) cin>>m[i];
    for(int i = 0;i<1<<n;i++){
        ll now = 0;
        for(int j = 0;j<n;j++) if(i>>j&1) now += m[j];
        now %= 1000;
        for(int j = 0;j<n;j++) if(~i>>j&1){
            ll use = max(0LL,m[j]-now);
            dp[i|1<<j] = min(dp[i|1<<j],dp[i]+use);
        }
    }
    cout<<dp.back()<<endl;
        
}