#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define LL long long

int N;
int M[15];

int main() {
	cin >> N;
	vector<int>v(N);
	for (int i = 0; i < N; i++) {
		cin >> M[i];
		v[i] = i;
	}

	int ans = 114514810;

	do {
		int sum = 0;
		int teika = 0;
		for (int i : v) {
			sum += max(0, M[i] - teika % 1000);
			teika += M[i];
		}
		ans = min(ans, sum);
	} while (next_permutation(v.begin(), v.end()));

	cout << ans << endl;
	return 0;
}