#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

const int INF = 1e9;

int main() {
	int n;

	cin >> n;
	vector<int> m(n);
	for (int i = 0; i < n; i++) {
		cin >> m[i];
	}

	int n_stat = (1 << n);

	vector<int> dp(n_stat, INF);
	vector<int> sum(n_stat, -1);
	dp[0] = 0;
	sum[0] = 0;

	for (int i = 0; i < n_stat; i++) {

		for (int j = 0; j < n; j++) {
			if (i & (1 << j)) {
				continue;
			}

			int next_stat = (i | (1 << j));
			if (sum[next_stat] == -1) {
				sum[next_stat] = sum[i] + m[j];
			}

			dp[next_stat] = min(dp[next_stat], dp[i] + max(0, m[j] - sum[i] % 1000));
		}
	}

	cout << dp[n_stat - 1] << endl;
	return 0;
}