#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int mod = 1000000007;
const double pi = acos(-1.0);
inline void gn(long long& x) {
  int sg = 1;
  char c;
  while (((c = getchar()) < '0' || c > '9') && c != '-')
    ;
  c == '-' ? (sg = -1, x = 0) : (x = c - '0');
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= sg;
}
inline void gn(int& x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(unsigned long long& x) {
  long long t;
  gn(t);
  x = t;
}
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long powmod(long long a, long long x, long long mod) {
  long long t = 1ll;
  while (x) {
    if (x & 1) t = t * a % mod;
    a = a * a % mod;
    x >>= 1;
  }
  return t;
}
const int maxn = 3e5 + 5;
int dp[maxn][55];
int main() {
  int n;
  gn(n);
  memset(dp, 0x3f, sizeof(dp));
  dp[0][0] = 0;
  for (int i = (1); i <= (n); i++) {
    int x;
    gn(x);
    x /= 100;
    int bk = x / 10;
    for (int j = (0); j <= (50); j++) {
      if (j >= x)
        dp[i][j - x] = min(dp[i][j - x], dp[i - 1][j]);
      else {
        int nd = x - j;
        dp[i][0] = min(dp[i][0], dp[i - 1][j] + nd);
      }
      int up = min(50, j + bk);
      dp[i][up] = min(dp[i][up], dp[i - 1][j] + x);
    }
  }
  int ans = inf;
  for (int i = (0); i <= (50); i++) ans = min(ans, dp[n][i]);
  cout << ans * 100 << endl;
  return 0;
}
