#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = max(x, y);
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
//const int INF = 1 << 30;//10^9
const ll INF = INFL;
//ll MOD = 1000000007;
ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll get_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

//素因数列挙
vector<ll> MakePrimeList(ll x) {
    vector<ll> res;
    for(ll k=2; k*k<=x; k++) {
        if(x % k == 0) {
            res.pb(k);
            while(x % k == 0) x /= k;
        }
    }
    if(x > 1) res.push_back(x);
    return res;
}


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
ll N;
vector<ll> A;
void solve(){
  ll pos[N][16];
  rep(i, N)rep(j, 16)pos[i][j] = INFL;
  rep(i, 16){
    pos[N-1][i] = i * 2;
  }
  for(ll i = N-2; i >= 0; i--){
    for(ll j = 0; j <= 15; j++){
      ll a = A[i];
      rep(_, j) a *= 4;
      ll b = A[i+1];
      ll cnt = 0;
      while(a > b){
        b *= 4;
        cnt++;
      }
      if(cnt <= 15){
        pos[i][j] = pos[i+1][cnt] + 2 * j;
      }else{
        pos[i][j] = pos[i+1][15] + 2 * (cnt-15) * (N-i-1) + 2 * j;
      }
    }
  }
  vector<ll> right(N+1);
  right[N] = 0;
  rep(i, N){
    ll m = INFL;
    rep(j, 15){
      m = min(m, pos[i][j]);
    }
    right[i] = m;
  }

  vector<ll> eff(N, 0);
  rep(i, N){
    A[i] *= -2;
  }
  ll neg[N][16];
  rep(i, N)rep(j, 16)neg[i][j] = INFL;
  rep(i, 16){
    neg[0][i] = i * 2 + 1;
  }
  for(ll i = 1; i < N; i++){
    for(ll j = 0; j <= 15; j++){
      ll b = A[i];
      rep(_, j) b *= 4;
      ll a = A[i-1];
      ll cnt = 0;
      while(a > b){
        a *= 4;
        cnt++;
      }
      if(cnt <= 15){
        neg[i][j] = neg[i-1][cnt] + 2 * j + 1;
      }else{
        neg[i][j] = neg[i-1][15] + 2 * (cnt-15) * i + 2 * j + 1;
      }
    }
  }
  vector<ll> left(N+1, 0);
  rep(i, N){
    ll m = INFL;
    rep(j, 15) m = min(m, neg[i][j]);
    left[i+1] = m;
  }
  ll ans = INFL;
  rep(i, N){
    ans = min(ans, left[i] + right[i]);
  }
  cout << ans << endl;
}
int main(){
  cin >> N;
  A.resize(N);
  rep(i, N) cin >> A[i];
  solve();
}


Measured memory_bytes: 56448