#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream& operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream& operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream& operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N;
vector<lint> A;

lint power(lint x, lint n, lint MOD=10000000000000000)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= MOD;
        (x *= x) %= MOD;
       n >>= 1;
    }
   return ans;
}

vector<lint> counts(vector<lint> A)
{
    int N = A.size();
    vector<lint> ans(N + 1);

    ans[1] = 0;
    map<lint, pint> ma;
    ma[A[N - 1]] = pint(1, 1000000000);

    FOR(i, 1, N)
    {
        ans[i + 1] = ans[i];
        lint q = A[N - 1 - i];

        int p = 0;
        while (ma.begin()->first * power(2, p) < q) p += 2;

        while (p > 0)
        {
            pint pa = ma.begin()->second;
            int decl = min(p, pa.second);
            ma.begin()->second.second -= decl;
            p -= decl;
            ans[i + 1] += ma.begin()->second.first * decl;

            while (ma.begin()->second.second == 0)
            {
                pint merge_info = next(ma.begin())->second;
                ma.begin()->second.first += merge_info.first;
                ma.begin()->second.second = merge_info.second;
                ma.erase(next(ma.begin()));
            }
        }

        int ppp = 0;
        while (q * power(2, ppp + 2) <= A[N - i]) ppp += 2;
        if (ppp) ma[q] = pint(1, ppp);
        else
        {
            pint info = ma.begin()->second;
            ma.erase(ma.begin());
            ma[q] = info;
            ma[q].first++;
        }
    }
    return ans;
}

int
main()
{
    cin >> N;
    A.resize(N);
    cin >> A;
    // 負がi項のために必要な乗算回数 - i

    vector<lint> sei = counts(A);
    reverse(A.begin(), A.end());
    vector<lint> fu = counts(A);
    reverse(A.begin(), A.end());

    lint ans = 1E18;
    REP(nsei, N + 1)
    {
        int nfu = N - nsei;
        Min(ans, fu[nfu] + sei[nsei] + nfu);
    }
    cout << ans << endl;
}


Measured memory_bytes: 6500