#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define REP3(i, m, n) for(int i = m, i##_len=(n);i < i##_len;i++)
#define FORVEC(i, v) for(int i = 0;i < v.size();i++)

#define INF 1000000000
#define pb(a) push_back(a)
#define llong long long
#define vi vector<int>
#define P pair<int,int>
#define all(vec) (vec.begin()),(vec.end())

int main(){
	int n;
	int a;
	vi m;
	cin>>n;
	vi dp(1<<n,INF);
	dp[0]=0;
	REP(i,n){
		cin>>a;
		m.pb(a);
	}
	REP(i,1<<n){
		int imamade=0;
		REP(j,n)if(i&(1<<j))imamade+=m[j];
		REP(j,n){
			if(!(i&(1<<j))){
				dp[i|(1<<j)]=min(dp[i|(1<<j)],dp[i]+max(0,m[j]-(imamade%1000)));
			}
		}
	}
	cout<<dp[(1<<n)-1]<<"\n";
	return 0;
}