// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
// #include<deque>
// #include<multiset>
// #include<bitset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;


// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
// clang-format off
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":", ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream &o, tuple<T...> const &t){ o << "("; _ot<0>(o, t); o << ")"; return o; }
template<class T, class U> ostream & operator<<(ostream &o, pair<T, U> const &p) { o << "(" << p.first << ", " << p.second << ")"; return o; }
template < class T > ostream &operator<<(ostream &o, const stack<T> &a) { o << "{"; for(auto tmp = a; tmp.size(); tmp.pop()) o << (a.size() == tmp.size() ? "" : ", ") << tmp.top(); o << "}"; return o; }
template <class T, class Container, class Compare > ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> a) { os << "{ (top) "; while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop(); os << " }"; return os; }
template <class T, class Container > ostream &operator<<(ostream &os, queue<T, Container> a) { os << "{ "; while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop(); os << " }"; return os; }
#ifdef DEBUG
#if !defined(DEBUG_OUT)
#define DEBUG_OUT cerr
#endif
#if !defined(DEBUG_LEFT)
#define DEBUG_LEFT "\e[1;36m"
#endif
#if !defined(DEBUG_RIGHT)
#define DEBUG_RIGHT ":\e[m"
#endif
#define dump(...) [&](){auto __debug_tap=make_tuple(__VA_ARGS__);DEBUG_OUT<<DEBUG_LEFT<<__LINE__ << DEBUG_RIGHT << " " <<#__VA_ARGS__<<" = "<<__debug_tap<<endl;}()
template < class T > inline void dump2D(T &d, size_t sizey, size_t sizex) { for(size_t i = 0; i < sizey; i++) { DEBUG_OUT << "\t"; for(size_t j = 0; j < sizex; j++) DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t"); DEBUG_OUT << endl; } }
template < class T, class = typename iterator_traits< decltype(begin(T())) >::value_type, class = typename enable_if<!is_same<T, string>::value>::type > ostream &operator<<(ostream &o, const T &a) { o << "{"; for(auto ite = begin(a); ite != end(a); ++ite) o << (ite == begin(a) ? "" : ", ") << *ite; o << "}"; return o; }
#else
#define dump(...) (42)
#define dump2D(...) (42)
template < class T, class = typename iterator_traits< decltype(begin(T())) >::value_type, class = typename enable_if<!is_same<T, string>::value>::type > ostream &operator<<(ostream &o, const T &a) { for(auto ite = begin(a); ite != end(a); ++ite) o << (ite == begin(a) ? "" : " ") << *ite; return o; }
#endif
// clang-format on
// }}}


ll a[212345];
ll c[212345];

ll dp0[212345];
ll dp1[212345];

int main() {
  ios::sync_with_stdio(false), cin.tie(0);

  int n; cin >> n;
  for(int i = 0; i < n; i++) cin >> a[i];

  {
  using P = pair<ll, ll>;
  stack<P> st;
  const ll inf = 1e18;
  st.emplace(0, inf);

  dp0[0] = 0;
  dp0[1] = 0;
  for(int i = 1; i < n; i++) {
    ll t = a[i-1], h = 0;
    while(t < a[i]) t *= 4, h++;
    dp0[i + 1] = dp0[i];
    while(h > 0) {
      auto p = st.top();
      st.pop();
      ll use = min(h, p.second);
      h -= use;
      p.second -= use;
      dp0[i+1] += use * (i - p.first);
      if(p.second > 0) st.push(p);
    }
    ll u = a[i];
    h = 0;
    while(u < t) u *= 4, h++;
    st.emplace(i, max(0ll, h - 1));
  }
  }
  
  {
  reverse(a, a + n);
  using P = pair<ll, ll>;
  stack<P> st;
  const ll inf = 1e18;
  st.emplace(0, inf);

  dp1[0] = 0;
  dp1[1] = 0;
  for(int i = 1; i < n; i++) {
    ll t = a[i-1], h = 0;
    while(t < a[i]) t *= 4, h++;
    dp1[i + 1] = dp1[i];
    while(h > 0) {
      auto p = st.top();
      st.pop();
      ll use = min(h, p.second);
      h -= use;
      p.second -= use;
      dp1[i+1] += use * (i - p.first);
      if(p.second > 0) st.push(p);
    }
    ll u = a[i];
    h = 0;
    while(u < t) u *= 4, h++;
    st.emplace(i, max(0ll, h - 1));
  }
  }
  
  ll ans = 1e18;
  for(int i = 0; i <= n; i++) {
    dump(i, dp0[i] * 2, dp1[n-i] * 2);
    ans = min(ans, i + dp0[i] * 2 + dp1[n-i] * 2);
  }

  cout << ans << endl;
  return 0;
}


Measured memory_bytes: 9984