#include <bits/stdc++.h>

using namespace std;

const int INF = 1<<30;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<int> cost(n);
  for (int i = 0; i < n; i++)
    cin >> cost[i];
  
  vector<int> dp(1<<n);
  
  for (int mask = 1; mask < 1<<n; mask++) {
    dp[mask] = INF;
    int sum = 0;
    for (int i = 0; i < n; i++)
      if (mask & 1 << i)
        sum += cost[i];
    for (int i = 0; i < n; i++) {
      if (mask & 1 << i) {
        int nask = mask ^ (1 << i);
        int discount = (sum - cost[i]) % 1000;
        dp[mask] = min(dp[mask], dp[nask] + max(0, cost[i] - discount));
      }
    }
  }

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