#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
#include<list>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {1, 1, 0, -1, -1, 0};
int dx[] = {1, 0, -1, -1, 0, 1};
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)

int main() {
    int n;
    cin >> n;
    int m[n];
    rep(i, n) cin >> m[i];
    int dp[1 << 15]; rep(i, (1 << 15)) dp[i] = inf;
    dp[0] = 0;
    rep(i, (1 << n)) {
    	int price = 0;
    	rep(j, n) {
    		if (i & (1 << j)) {
    			price += m[j];
    		}
     	}
        rep(j, n) {
            if (!(i & (1 << j))) {
                chmin(dp[i | 1 << j], (dp[i] == 0 ? m[j] : dp[i] + max(0, m[j] - price % 1000)));
            }
        }
    }
    //rep(i, (1 << n)) cout << dp[i] << " "; cout << endl;
    cout << dp[(1 << n) - 1] << endl;
}