#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#include <complex>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================


auto lst(ll n, const VL& v) {

	VL r(n);
	stack<PAIR> stk;
	stk.emplace(n - 1, 1e10);
	r[n - 1] = 0;
	ll now = v[n - 1];
	RREP(i, n - 1) {
		ll p = now;
		ll cnt = 0;
		REP(j, 100) {
			if (p >= v[i]) { break; }
			p *= 4;
			++cnt;
		}
		r[i] = r[i + 1];
		while (true) {
			if (cnt <= stk.top().second) {
				r[i] += 2 * (stk.top().first - i) * cnt;
				stk.top().second -= cnt;
				if (stk.top().second == 0) { stk.pop(); }
				break;
			} else {
				r[i] += 2 * (stk.top().first - i) * stk.top().second;
				cnt -= static_cast<ll>(stk.top().second);
				stk.pop();
			}
		}

		ll k = v[i];
		ll pw = -1;
		REP(j, 100) {
			if (k > p) { break; }
			k *= 4;
			++pw;
		}
		if (pw > 0) { stk.emplace(i, pw); }

		now = v[i];
	}
	return r;
}

signed main() {
	ll n;
	cin >> n;
	VL v(n);
	cin >> v;

	auto r = lst(n, v);
	std::reverse(ALL(v));
	auto l = lst(n, v);
	std::reverse(ALL(l));
	REP(i, n) { l[i] += i + 1; }

	ll ans = std::min(l[n - 1], r[0]);
	REP(i, n - 1) {
		chmin(ans, l[i] + r[i + 1]);
	}
	cout << ans << endl;
	dump(l, r);
}


Measured memory_bytes: 4992