#include <iostream>
#include <algorithm>

using namespace std;

#define INF 100000

int money[1 << 15];

int N;
int M[15];

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

	for (int i = 0; i < 1 << N; i++) {
		money[i] = INF;
	}
	money[0] = 0;

	for (int i = 0; i < 1 << N; i++) {
		int m = 0;
		for (int j = 0; j < N; j++) {
			if ((i >> j) % 2 == 1) {
				m += M[j];
			}
		}
		for (int j = 0; j < N; j++) {
			int price = M[j] - (m % 1000);
			if (price < 0) price = 0;
			money[i | 1 << j] = min(money[i | 1 << j], money[i] + price);
		}
		
	}

	cout << money[(1 << N) - 1];
	getchar();
	getchar();

	return 0;
}