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

#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repr(i,b,e) for(int i = (b); i <= (e); i++)

#define pr(x) do{cerr << (#x) << " = " << (x) << endl;}while(0)
#define pri(x,i) do{cerr << (#x) << "[" << i << "] = " << (x[i]) << endl;}while(0)

namespace std {
	template<class S, class T> pair<S, T> operator + (const pair<S, T> &a, const pair<S, T> &b) {return mp<S, T>(a.first + b.first, a.second + b.second);}
	template<class S, class T> pair<S, T> operator - (const pair<S, T> &a, const pair<S, T> &b) {return mp<S, T>(a.first - b.first, a.second - b.second);}
	template<class S, class T> pair<S, T>& operator += (pair<S, T> &a, const pair<S, T> &other) {return a = a + other;}
	template<class S, class T> pair<S, T>& operator -= (pair<S, T> &a, const pair<S, T> &other) {return a = a - other;}
	template<class S, class T> ostream& operator << (ostream& ost, pair<S, T> p) {ost << "(" << p.first << ", " << p.second << ")";return ost;}
	template<class T> ostream& print_iterable_container(ostream& ost, T& container) {
		for (auto&& iter = begin(container); iter != end(container); ++iter) ost << (iter == begin(container) ? " [ " : ", ") << (*iter);
		return ost << " ]";
	}
#	define APPLY_PRINT_ITERABLE_CONTAINER(container_type)\
	template<class T> ostream& operator << (ostream& ost, container_type<T>& container) {\
		return print_iterable_container(ost, container);\
	}
	APPLY_PRINT_ITERABLE_CONTAINER(vector);
	APPLY_PRINT_ITERABLE_CONTAINER(list);
	APPLY_PRINT_ITERABLE_CONTAINER(deque);
}

template<class T> inline bool CHMAX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool CHMIN(T &l,const T &r){return l>r?l=r,1:0;}

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vpii = vector<pii>;
using vpll = vector<pll>;

using ld = long double;

template<class T> using VV = vector<vector<T> >;
template<class T> using maxPQ = priority_queue<T>;
template<class T> using minPQ = priority_queue<T, vector<T>, greater<T> >;
template<class T, class U> using uomap = unordered_map<T, U>;
template<class T> using uoset = unordered_set<T>;

const ll INF = 1001001001;
const ll INFll = (ll)INF * INF;
const ll MOD = 1000000007;
const ll MOD_FFT = 998244353;
const ld EPS = 1e-15;

//function<void(int,int)> tensi_no_3p=[&](int v,int d){
//};

vll sums(vll arr) {
	int N = arr.size();
	maxPQ<pll> pq;
	vll ret(N);
	ll sum = 0;
	for (int i = N - 1; i >= 0; i--) {
		sum += arr[i];
		ll cnt = 1;
		while (! pq.empty()) {
			pll top = pq.top();
			if (top.first >= arr[i]) {
				pq.pop();
				sum -= (top.first - arr[i]) * top.second;
				cnt += top.second;
			}
			else {
				break;
			}
		}
		pq.push(mp(arr[i], cnt));
		ret[i] = sum;
	}
	return move(ret);
}

vll calc(vector<ld> B) {
	int N = B.size();
	vll ret(N);
	ld maxval = 0;
	rep(i, N) {
		ll t = maxval >= B[i] - EPS ? (ll)ceil((maxval - B[i] - EPS) / 2) : 0;
		B[i] += 2 * t;
		ret[i] += 2 * t;
		CHMAX(maxval, B[i]);
	}
	vll s = sums(ret);
	vll ss(N);
	ll ps = 0;
	for (int i = N - 1; i >= 0; i--) {
		ps += ret[i];
		ss[i] = ps - s[i];
	}
	return move(ss);
}

int main() {
	ios_base::sync_with_stdio(false);
	int N; cin >> N;
	vi A(N);
	rep(i, N) cin >> A[i];
	vector<ld> B(N);
	rep(i, N) {
		B[i] = log2l(A[i]);
	}
	vll l2r = calc(B);
	reverse(B.begin(), B.end());
	vll r2l = calc(B);
	ll ans = INFll;
	rep(i, N) {
		CHMIN(ans, i + l2r[i] + r2l[N - 1 - i]);
	}
	cout << ans << endl;
	return 0;
}


Measured memory_bytes: 13556