#include <bits/stdc++.h>
using namespace std;
const int Imx = 2147483647;
const long long Lbig = 2e18;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c == ' ' || c == '\n') c = _buff.get();
  return c;
}
int n, a[300111];
long long pre[300111];
int main() {
  n = getnum();
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    a[i] = getnum();
    sum += a[i];
    pre[i] = pre[i - 1] + a[i];
  }
  pre[n + 1] = pre[n];
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = max(ans, min(pre[i] / 10, pre[n] - pre[i]));
  }
  int ir = 1;
  for (int i = 1; i <= n; i++) {
    while (i <= n && a[i] == a[ir]) ir++;
    long long cur = min(pre[i - 1] / 10, pre[ir - 1] - pre[i - 1]);
    long long lft = pre[i - 1] - cur * 10;
    int l = ir, r = n;
    while (l <= r) {
      int mid = l + r >> 1;
      if ((pre[mid] - pre[ir - 1] + lft) / 10 < pre[n] - pre[mid])
        l = mid + 1;
      else
        r = mid - 1;
    }
    long long a1 = min((pre[l] - pre[ir - 1] + lft) / 10, pre[n] - pre[l]);
    long long a2 = min((pre[r] - pre[ir - 1] + lft) / 10, pre[n] - pre[r]);
    ans = max(ans, max(cur + a1, cur + a2));
  }
  cout << sum - ans << endl;
  return 0;
}
