#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  int M[N];
  for (int i = 0; i < N; i++) {
    cin >> M[i];
  }
  
  int dp[1<<N];
  for (int i = 0; i < (1<<N); i++) {
    dp[i] = 100000000;
  }
  dp[0] = 0;
  for (int i = 0; i < (1<<N); i++) {
    int cost = 0;
    for (int j = 0; j < N; j++) {
      if ((i & (1<<j)) != 0) {
        cost += M[j];
      }
    }
    cost %= 1000;
    for (int j = 0; j < N; j++) {
      if ((i & (1<<j)) == 0) {
        int idx = i | (1<<j);
        dp[idx] = min(dp[idx], dp[i] + max(0, M[j] - cost));
      }
    }
  }
  cout << dp[(1<<N) - 1] << "\n";
  return 0;
}