#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define inf 1000000000000000LL
#define mod 1000000007LL
#define FOR(i,a,b) for(int i = a; i < b; i++)

void solve() {
    ll n;
    cin >> n;
    vector <ll> l1(n);
    for (int i = 0; i < n; i++) cin >> l1[i];
    auto w = [&](ll x){
        ll cost = 0;
        while (x >= 1){
            cost++;
            if (x % 2 == 0) x/=2; 
            else x--;
        }
        return cost;
    };
    auto flag = [&](ll x){
        ll cost = 0;
        for (int  i= 0; i < n; i++){
            for (int j = 0; j < x; j++){
                l1[i] /= 2;
            }
            ll z = inf;
            for (int j = l1[i]; j < l1[i] + 20; j++){
                z = min(z, w(j) + ((1LL << x)*(j - l1[i])));
            }
            cost += z;
        }
        // cout << cost << "\n";
        return cost;
    };
    ll answ = inf;
    for (ll i = 0; i <= 25; i++){
        vector <ll> cur = l1; ll cost = i;
        for (ll j =0; j < n; j++){
            ll v = (1LL << (i));
            ll dif = l1[j] % v;
            if (dif >= 1){
                cost += v - dif;
                l1[j] += v - dif;
            }
        }
        // cout << cost << " ";
        cost += flag(i);
        // cout << cost << "\n";
        answ = min(answ, cost);
        l1 = cur;
    }
    cout << answ << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}