#include <bits/stdc++.h>
using namespace std;

#define BIT(i) (1 << (i))
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define CHMIN(a, b) a = min(a, b)

const int INF = 1 << 28;

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

int main()
{
	cin >> n;
	REP(i, n) cin >> a[i];
	
	fill_n(dp, 1 << 15, INF);
	dp[0] = 0;
	
	REP(k, n) REP(bit, BIT(n)){
		if (dp[bit] == INF) continue;
		
		int s = 0;
		REP(i, n) if (bit & BIT(i)) s += a[i];
		s %= 1000;
		
		REP(i, n){
			if (bit & BIT(i)) continue;
			int t = max(0, a[i] - s);
			CHMIN(dp[bit | BIT(i)], dp[bit] + t);
		}
	}
	
	cout << dp[BIT(n) - 1] << endl;
}