#include <iostream>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

int n;
int a[15];
int dp[1 << 15];

int main() {
	int i, j, k;
	
	cin >> n;
	rep(i, n) cin >> a[i];
	
	int INF = 1e+9;
	rep(i, (1 << n)) dp[i] = INF;
	
	dp[0] = 0;
	rep(i, (1 << n) - 1) {
		rep(j, n) {
			if ((i >> j) % 2 == 1) continue;
			//商品jを新しく購入してみる
			int imamade = 0;
			rep(k, n) if ((i >> k) % 2 == 1) imamade += a[k];
			int okane = a[j] - imamade % 1000;
			if (okane < 0) okane = 0;
			dp[i + (1 << j)] = min(dp[i + (1 << j)], dp[i] + okane);
		}
	}
	cout << dp[(1 << n) - 1] << endl;
	return 0;
}