#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(n,a,b) (a<=(n)&&(n)<b)
typedef long long ll;
using namespace std;
int dp[1<<15];
int main(){
	int N;
	int M[16];
	cin>>N;
	REP(i,0,N){
		cin>>M[i];
	}
	REP(i,0,1<<N) dp[i]=1e8;
	int money[1<<15];
	money[0]=0;
	REP(i,0,1<<N){
		REP(j,0,N){
			if(i&1<<j) money[i]+=M[j];
		}
		money[i]%=1000;
	}
	dp[0]=0;
	REP(st,0,1<<N){
		REP(i,0,N){
			dp[st]=min(dp[st],max(dp[st^(1<<i)],dp[st^(1<<i)]+M[i]-money[st^(1<<i)]));
		}
	}
	p(dp[(1<<N)-1]);
	return 0;
}