#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define PG_Mazen ios_base::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
#define el '\n'
#define sp ' '
#define all(v) v.begin(), v.end()
#define r_all(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define pb(n) push_back(n)
#define eb(n, m) emplace_back(n, m)
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll,ll>
#define F first
#define S second
#define loop int t; cin >> t; for(int i=1;i<=t;++i)
#define f0(i, st, n) for(int i=st;i<n;++i)
#define f1(i, st, n) for(int i=st;i<=n;++i)
#define fe(it, n) for(auto &it : n)
#define mms(arr, val) memset(arr, val, sizeof arr)
#define mmv(vec, val) memset(vec[0], val, sizeof(vec) * SZ(vec))
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>

const int N = 2e5 + 5, MOD = 998244353, oo = 0x3f3f3f3f;
const ll ooo = 0x3f3f3f3f3f3f3f3f;

ull solve(ull a, ull b) {
    // a <= b * 2^x
    ull ans = 0;
    for (ull i = 1; i <= 63; ++i) {
        if (a <= b * (1ull << i)) {
            ans = i;
            break;
        }
    }
    return ans;
}

void testCase() {
    ll n;
    cin >> n;
    vector<ull> v(n);
    for (int i = 0; i < n; ++i) cin >> v[i];
    ull ans = 0;
    for (ull i = 1; i < n; ++i) {
        if (v[i - 1] <= v[i])
            continue;
        ull res = solve(v[i - 1], v[i]);
        v[i] = v[i] * (1ull << res);
        ans += res;
    }
    cout << ans << '\n';
}

int main() {
    PG_Mazen
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    loop testCase();
}