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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

using lld = int64_t;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  cin >> n;

  vector<lld> a(n), pre(n + 1);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }

  for (int i = 0; i < n; i++)
    pre[i + 1] = pre[i] + a[i];

  auto query = [&](int l, int r) -> lld {
    if (l == r) return 0;
    if (l < r)
      return pre[r] - pre[l];
    return pre[r] - pre[l] + pre[n];
  };

  const int LG = 60;

  vector<int> prv[LG], nxt[LG];
  for (int b = 0; b < LG; b++) {
    prv[b].assign(n, -1);
    int last = -1;
    for (int i = 0; i < n; i++) {
      if (a[i] >= (1LL << b)) last = i;
      prv[b][i] = last;
    }
    for (int i = 0; i < n; i++)
      if (prv[b][i] == -1)
        prv[b][i] = last;
      else
        break;
  }

  for (int b = 0; b < LG; b++) {
    nxt[b].assign(n, -1);
    int last = -1;
    for (int i = n - 1; i >= 0; i--) {
      if (a[i] >= (1LL << b)) last = i;
      nxt[b][i] = last;
    }
    for (int i = n - 1; i >= 0; i--)
      if (nxt[b][i] == -1)
        nxt[b][i] = last;
      else
        break;
  }

  lld ans = 1e13;

  for (int start = 0; start < n; start++) {
    int l = (start + 1) % n;
    int r = start;
    lld x = a[start] * 2;
    lld cur = a[start];
    while (l != r) {
      int lev = x==0 ? 0 : __lg(x);
      debug(x, l, r);
      if (nxt[lev][l] == -1) {
        break;
      }
      assert(prv[lev][(r + n - 1) % n] != -1);

      int L = nxt[lev][l];
      int R = prv[lev][(r + n - 1) % n];

      x += query(l, L);
      x += query((R + 1) % n, r);
      l = L;
      r = (R + 1) % n;

      if (x >= a[L]) {
        x += a[L];
        l = (L + 1) % n;
      } else if (x >= a[R]) {
        x += a[R];
        r = R;
      } else {
        lld add = min(a[L], a[R]) - x;
        x += add;
        cur += add;
      }
    }

    debug(start, cur);
    ans = min(ans, cur);
  }

  cout << ans << '\n';

  return 0;
}