#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// root: max (tie-break: left)
struct MaxCartesianTree {
  int n, rt;
  vector<int> par, lef, rig;
  template <class T> void build(int n_, T *as) {
    assert(n_ >= 1);
    n = n_;
    rt = 0;
    par.assign(n, -1);
    lef.assign(n, -1);
    rig.assign(n, -1);
    int top = 0;
    vector<int> stack(n, 0);
    for (int u = 1; u < n; ++u) {
      if (as[stack[top]] < as[u]) {  // <
        for (; top >= 1 && as[stack[top - 1]] < as[u]; --top) {}  // <
        if (top == 0) {
          rt = par[lef[u] = stack[top]] = u;
        } else {
          par[lef[u] = stack[top]] = u;
          rig[par[u] = stack[top - 1]] = u;
        }
        stack[top] = u;
      } else {
        rig[par[u] = stack[top]] = u;
        stack[++top] = u;
      }
    }
  }
  template <class T> void build(const T &as) {
    build(as.size(), as.data());
  }
};

////////////////////////////////////////////////////////////////////////////////


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRec {
  int logN, n;
  vector<T> ts;
  SegmentTreeRec() : logN(0), n(0) {}
  explicit SegmentTreeRec(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRec(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  //   f should return true on success. It must succeed for a single element.
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) chRec(aa++, f, args...);
      if (bb & 1) chRec(--bb, f, args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }
  template <class F, class... Args>
  void chRec(int u, F f, Args &&... args) {
    const int u0 = u;
    for (; ; ) {
      if ((ts[u].*f)(args...)) {
        for (; u0 < u && (u & 1); pull(u >>= 1)) {}
        if (u0 == u) return;
        ++u;
      } else {
        push(u);
        u <<= 1;
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


int N;
vector<int> A;


/*
  greedy
  x consecutive min elements -> ceil(x/2) (min+1)'s
*/
namespace slow {
Int ans;
vector<int> pre, suf;
int rec(int l, int r) {
  int mid = l;
  for (int i = l; i < r; ++i) if (A[mid] < A[i]) mid = i;
  if (l < mid) {
    const int res = rec(l, mid);
    const int da = min(A[mid] - res, 31);
    for (int i = l; i < mid; ++i) {
      ++(--pre[i] >>= da);
      ++(--suf[i] >>= da);
    }
  }
  if (mid + 1 < r) {
    const int res = rec(mid + 1, r);
    const int da = min(A[mid] - res, 31);
    for (int i = mid + 1; i < r; ++i) {
      ++(--pre[i] >>= da);
      ++(--suf[i] >>= da);
    }
  }
  Int here = 0;
  for (int i = l; i <= mid; ++i) for (int j = mid; j < r; ++j) {
    const int b = suf[i] + 1 + pre[j];
    const int e = (b == 1) ? 0 : ((31 - __builtin_clz(b - 1)) + 1);
// cerr<<"["<<i<<", "<<j<<"]: "<<A[mid]<<" + "<<e<<endl;
    here += A[mid] + e;
  }
  ans += here;
  {
    const int db = ((l < mid) ? pre[mid - 1] : 0) + 1;
    for (int i = mid; i < r; ++i) pre[i] += db;
  }
  {
    const int db = ((mid + 1 < r) ? suf[mid + 1] : 0) + 1;
    for (int i = l; i <= mid; ++i) suf[i] += db;
  }
cerr<<"[rec] ["<<l<<", "<<r<<"): here = "<<here<<endl;
cerr<<"  pre = ";pv(pre.begin()+l,pre.begin()+r);
cerr<<"  suf = ";pv(suf.begin()+l,suf.begin()+r);
  return A[mid];
}

Int run() {
  ans = 0;
  pre.assign(N, 0);
  suf.assign(N, 0);
  rec(0, N);
  return ans;
}
}  // slow


namespace fast {
constexpr int INF = 1001001001;
struct Node {
  int mn, mx;
  int lz;
  Node() : mn(+INF), mx(-INF), lz(0) {}
  Node(int val) : mn(val), mx(val), lz(0) {}
  void push(Node &l, Node &r) {
    if (lz) {
      l.add(lz);
      r.add(lz);
      lz = 0;
    }
  }
  void pull(const Node &l, const Node &r) {
    mn = min(l.mn, r.mn);
    mx = max(l.mx, r.mx);
  }
  bool add(int val) {
    mn += val;
    mx += val;
    lz += val;
    return true;
  }
  // x -> ceil(x / 2^e)
  bool div(int e) {
    if (mn == mx) {
      chmin(e, 30);
      const int tar = (mn + (1 << e) - 1) >> e;
      add(tar - mn);
      return true;
    } else {
      return false;
    }
  }
};

Int ans;
MaxCartesianTree ct;

SegmentTreeRec<Node> segPre, segSuf;
int pre(int i) { return segPre.get(i, i + 1).mn; }
int suf(int i) { return segSuf.get(i, i + 1).mn; }

int rec(int l, int mid, int r) {
  if (l < mid) {
    const int res = rec(l, ct.lef[mid], mid);
    const int da = A[mid] - res;
    segPre.ch(l, mid, &Node::div, da);
    segSuf.ch(l, mid, &Node::div, da);
  }
  if (mid + 1 < r) {
    const int res = rec(mid + 1, ct.rig[mid], r);
    const int da = A[mid] - res;
    segPre.ch(mid + 1, r, &Node::div, da);
    segSuf.ch(mid + 1, r, &Node::div, da);
  }
  const int lim = suf(l) + 1 + pre(r - 1);
  Int here = 0;
  if (mid - l + 1 <= r - mid) {
    for (int e = 0; 1 << e < lim; ++e) {
      for (int i = l; i <= mid; ++i) {
        // mid <= j < r s.t. suf(i) + 1 + pre(j) > 2^e
        const int sufI = suf(i);
        int jL = mid - 1, jR = r;
        for (; jL + 1 < jR; ) {
          const int jMid = (jL + jR) / 2;
          ((sufI + 1 + pre(jMid) > 1 << e) ? jR : jL) = jMid;
        }
        here += (r - jR);
      }
    }
  } else {
    for (int e = 0; 1 << e < lim; ++e) {
      for (int j = mid; j < r; ++j) {
        // l <= i <= mid s.t. suf(i) + 1 + pre(j) > 2^e
        const int preJ = pre(j);
        int iL = l - 1, iR = mid + 1;
        for (; iL + 1 < iR; ) {
          const int iMid = (iL + iR) / 2;
          (((suf(iMid) + 1 + preJ) > 1 << e) ? iL : iR) = iMid;
        }
        here += (iL - l + 1);
      }
    }
  }
  here += (Int)(mid - l + 1) * (r - mid) * A[mid];
  ans += here;
  {
    const int db = ((l < mid) ? pre(mid - 1) : 0) + 1;
    segPre.ch(mid, r, &Node::add, db);
  }
  {
    const int db = ((mid + 1 < r) ? suf(mid + 1) : 0) + 1;
    segSuf.ch(l, mid + 1, &Node::add, db);
  }
// cerr<<"[rec] ["<<l<<", "<<r<<"): here = "<<here<<endl;
// cerr<<"  pre = ";for(int i=l;i<r;++i)cerr<<pre(i)<<" ";cerr<<endl;
// cerr<<"  suf = ";for(int i=l;i<r;++i)cerr<<suf(i)<<" ";cerr<<endl;
  return A[mid];
}

Int run() {
  ans = 0;
  ct.build(A);
  segPre = SegmentTreeRec<Node>(vector<int>(N, 0));
  segSuf = SegmentTreeRec<Node>(vector<int>(N, 0));
  rec(0, ct.rt, N);
  return ans;
}
}  // fast


int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    
    const Int ans = fast::run();
    printf("%lld\n", ans);
#ifdef LOCAL
const Int slw=slow::run();
cerr<<"slw = "<<slw<<endl;
assert(slw==ans);
#endif
  }
  return 0;
}