#include <bits/stdc++.h>
#define el '\n'
#define ll long long
#define sandra ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#include <iostream>
const double PI = acos(-1);
long long gcd(long long a, long long b) { return (!a) ? b : gcd(b % a, a); }
//complexity o(log a*b)
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
using namespace std;
void solve() {
    int n; cin>>n;
    vector<int>v(n);
    for (int i=0;i<n;i++) {
        cin>>v[i];
    }
    unordered_map<ll,ll>vo;
    unordered_map<ll,ll>steps;
    for (int i=0;i<n;i++) {
    ll start=0;
        vo[v[i]]++;
        steps[v[i]]+=0;
        ll temp=v[i];
        if (v[i]==1) {
            steps[2]++;
            vo[v[i]+1]++;
            continue;
        }
        while (temp!=1 ) {
            if (temp%2==0) {
                //even
                temp/=2;
            }
            else {
               temp++;
            }
            start++;
            steps[temp]+=start;
            vo[temp]++;
        }
    }
    ll mini_steps=1e9;
    for (auto stepss:vo) {
        if (stepss.second==n) {
            mini_steps=min(steps[stepss.first],mini_steps);
        }
    }
    cout<<mini_steps<<el;
}
signed main() {
    sandra
    int t = 1;
    cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}