#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    vector<int> M(N);
    rep(i,N) cin >> M[i];

    vector<int> dp(1 << N, 1e9);
    dp[0] = 0;
    rep(S,1<<N) {
        int sum = 0;
        rep(i,N) if(S & (1 << i)) sum += M[i];
        rep(i,N) if(!(S & (1 << i))) {
            int x = max(0, M[i] - sum % 1000);
            dp[S | (1 << i)] = min(dp[S | (1 << i)], dp[S] + x);
        }
    }
    cout << dp[(1 << N) - 1] << endl;
}