#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<bitset>
#include<array>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstdlib>
using namespace std;
int n, a, b, d, e,t,u;
int i, j, k;
int p[32768],q[32768],inp[15];
int main() {
	cin >> n;
	for (i = 0; i < n; i++) {
		cin >> inp[i];
	}
	for (i = 0; i < 1<<n; i++) {
		for (j = 0; j < n; j++) {
			u = 1 << j;
			if ((i&u) == 0) {
				t = p[i] + max(inp[j] - q[i] % 1000, 0);
				if (!p[i + u] || t < p[i + u]) {
					p[i + u] = t;
					q[i + u] = q[i] + inp[j];
				}
			}
		}
	}
	cout << p[(1 << n) - 1] << endl;
}