#include <bits/stdc++.h>
using namespace std;
int dp[300005][35], a[300005];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i] /= 100;
  }
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= 30; j++) dp[i][j] = 1000000000;
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= 30; j++) {
      dp[i + 1][j + a[i + 1] / 10] =
          min(dp[i + 1][j + a[i + 1] / 10], dp[i][j] + a[i + 1]);
      dp[i + 1][j - min(j, a[i + 1])] =
          min(dp[i + 1][j - min(j, a[i + 1])],
              dp[i][j] + a[i + 1] - min(j, a[i + 1]));
    }
  }
  int maxx = 1000000000;
  for (int i = 0; i <= 30; i++) maxx = min(maxx, dp[n][i]);
  printf("%d00\n", maxx);
  return 0;
}
