#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	b += MOD;
	a += b;
	a %= MOD;
}

int n;
ll memo[33400],m[20];
bool done[33400];

ll dp(int st){
	int i;
	ll s=0ll;
	if(done[st]){
		return memo[st];
	}
	done[st] = true;
	for(i=0; i<n; ++i){
		if(st&(1<<i)){
			s += m[i];
		}
	}
	for(i=0; i<n; ++i){
		if(st&(1<<i)){
			memo[st] = min(memo[st],dp(st-(1<<i))+max(0ll,m[i]-(s-m[i])%1000));
		}
	}
	return memo[st];
}

int main(void){
	int i;
	fill(done,done+33400,false);
	fill(memo,memo+33400,INFLL);
	done[0] = true;
	memo[0] = 0ll;
	cin >> n;
	for(i=0; i<n; ++i){
		cin >> m[i];
	}
	cout << (dp((1<<n)-1)) << endl;
	return 0;
}