#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()

int N,T;
signed main()
{
    cin >> N;
    vector<int> M(N);
    REP(i,N) cin >> M[i];
    // 全組み合わせ中いちばん余りが1000に近いものを
    int maxi = 0;
    int maxc = 0;
    REP(i,1<<N) {
        int sum = 0;
        REP(j,N) {
            if (i & 1<<j) sum += M[j];
        }
        sum %= 1000;
        if (sum > maxc) {
            maxc = sum;
            maxi = i;
        }
    }
    vector<int> K;
    REP(i,N) {
        if (maxi & 1<<i) K.push_back(M[i]);
    }
    sort(ALL(K));
    // 1.iに含まれるやつを小さい順に買う
    int sum = 0;
    int price = 0;
    for (auto&& k : K) {
        price += max(0, k - (sum % 1000));
        sum += k;
    }
    // 2.余りが0のやつを全部買う
    REP(i,N) {
        if (M[i] % 1000 == 0) {
            int k = M[i];
            price += max(0, k - (sum % 1000));
            sum += k;
        }
    }
    // 3.高い順に買う...？
    sort(ALL(M));
    RREP(i,N) {
        if (M[i] % 1000 == 0) continue;
        if (maxi & 1<<i) continue;
        int k = M[i];
        price += max(0, k - (sum % 1000));
        sum += k;
    }
    cout << price << endl;
    return 0;
}