#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;

const int inf  = 1000000000;

int main(){
  int N;
  cin >> N;
  int M[N];
  for(int i=0;i<N;i++) cin >> M[i];

  int dp[1<<N];
  int sum[1<<N];
  fill(dp,dp+(1<<N),inf);
  fill(sum,sum+(1<<N),0);
  dp[0] = 0;
  for(int msk=0;msk<(1<<N);msk++){
    for(int i=0;i<N;i++){
      if(!(msk & (1<<i))){
        int x; //商品iの値段
        x = max(0, M[i] - sum[msk] % 1000);
        //cout << x << endl;
        dp[msk + (1<<i)] = min((dp[msk + (1<<i)]), dp[msk] + x);
        sum[msk + (1<<i)] = sum[msk] + M[i];
      }
    }
  }

  cout << dp[(1<<N) - 1] << endl;
  return 0;
}