#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

void solve(){
	int K;
	cin >> K;
	vector<int> bitNum(K);
	vector<int> M(K);
	
	for(int i=0;i<K;++i){
		cin >> M[i];
	}
	bitNum[0] = 1;
	for(int i=1;i<K;++i){
		bitNum[i] = bitNum[i-1] * 2;
	}

	//vector<int> dp(1<<K,10000*K+1);
	vector<int> dp(1<<K,0);
	
	int all;
	int hiki;
	int nedan;
	int retBit;
	const int mod = 1000;
	for(int mask = 0 ; mask < ( 1<<K ); ++mask ){
		all = 0;
		for( int bitS = 0; bitS < K ; ++bitS){
			if( mask & bitNum[ bitS ] ){
				all += M[bitS];
			}
		}
		for( int bitS = 0; bitS < K ; ++bitS){
			if( !( mask & bitNum[ bitS ] ) ){
				hiki = all % mod;
				nedan = max(0, M[bitS] - hiki );

				retBit = mask | bitNum[ bitS ];
				if( 0 == dp[ retBit ] ){
					dp[ retBit ] = dp[ mask ] + nedan;
				}else{
					dp[ retBit ] = min( dp[ retBit ], dp[ mask ] + nedan );
				}
			}
		}
	}
	cout << dp[ (1 << K) - 1] << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}