#include <bits/stdc++.h>
using namespace std;

const int INF = 1e8;
int N;
int M[20];
int dp[1<<20];

void solve() {
   fill(dp, dp+(1<<N), INF);
   dp[0] = 0;

   for (int mask = 0; mask < (1<<N); mask++) {
      int discount = 0;
      for (int i = 0; i < N; i++) {
         if (mask & (1<<i)) discount += M[i];
      }
      discount %= 1000;

      for (int i = 0; i < N; i++) {
         if ((mask | (1<<i)) == (mask)) continue;
         int price = max(0, M[i] - discount);
         dp[mask | (1<<i)] = min(dp[mask | (1<<i)], dp[mask] + price);
      }
   }
   cout << dp[(1<<N)-1] << endl;
}

int main() {
   // 入力
   cin >> N;
   for (int i = 0; i < N; i++) { cin >> M[i]; }
   solve();

   return 0;
}