#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
#include<math.h>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef long long ll;
typedef pair<int,int> pint;
const ll mod= 1e9+7;
const int inf=1e9+7;
const ll  longinf = 1LL<<60;
int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};

int dp[101010],sum[101010];
int main(){
  int n;cin>>n;
  int a[n];
  rep(i,n)cin>>a[i];
  int all=1<<n;
  rep(i,all)rep(j,n)
    if(i&(1<<j))sum[i]+=a[j];
  rep(i,all)dp[i]=inf;
  dp[0]=0;
  rep(i,all){
    rep(j,n){
      if(i&(1<<j)){
        int res=dp[i^(1<<j)];
        res+=max(0,a[j]-sum[i^(1<<j)]%1000);
        dp[i]=min(res,dp[i]);
        }
      }
    }
  cout<<dp[all-1]<<endl;
  return 0;

  }