/*
[templates]: 
duipai
spjdp
compre
addhis
floor_sum
treedfs
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(time(0)); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N = 262144; 
int a[N + 10], b[N + 10], c[N + 10]; int s[N + 10]; 
int ans = 0; vector<int> tyl[N + 10]; int n; 
int mxp(int l, int r) {
    //[l, r] 内 popcount 最小值.
    int res = __builtin_popcount(l); 
    int tot = 0; 
    for(int i = 30; i >= 0; i --) {
        if(((l >> i) & 1) != ((r >> i) & 1)) {
            cmin(res, tot + 1); 
            break; 
        }
        if((l >> i) & 1) tot ++;
    }
    return res; 
}
void solve(int t) {
    // f(i, 0, t) tyl[i].clear(); 
    // f(i, 1, n) tyl[a[i] % t].push_back(i); 
    int lban = 0, rban = 0, zh = 0, fu = 0, hf = n / 2;
    f(i, 1, n) s[i] = c[i] - b[i];
    sort(s + 1, s + n + 1); 
    
    f(i, 1, hf) lban += s[i]; 
    for(int i = n; i >= n - hf + 1; i --) rban += s[i];
    f(i, 1, n) if(s[i] < 0) fu += s[i]; 
    else zh += s[i];  
    int mid = (n + 2) >> 1;
    vector<int> vec; 
    vec.push_back(0); 
    f(i, 1, n) vec.push_back(t - a[i] % t); 
    sort(vec.begin(), vec.end()); 
    int unq = unique(vec.begin(), vec.end()) - vec.begin() - 1; 
    // cerr << "unq = " << unq << endl;
    f(i, 1, n) tyl[lower_bound(vec.begin(), vec.begin() + unq + 1, t - a[i] % t) - vec.begin()].push_back(i); 
    auto inc = [&](int x) {
        int it = upper_bound(s + 1, s + n + 1, x) - s - 1;
        s[it] ++;
        if(it <= hf) lban ++; 
        else if(it >= n - hf + 1) rban ++; 
        if(s[it] <= 0) fu ++; 
        else zh ++;  
    }; 
    f(id, 0, unq) {
        int x = vec[id]; 
        int cost = (s[mid] >= 0 ? zh - fu : rban - lban);
        // cerr << "T = " << t << ", x = " << x << endl; 
        // f(i, 1, n) cerr << s[i] << " \n"[i == n ]; 
        // cerr << "zh = " << zh << ", fu = " << fu << endl; 
        // cerr << "cost = " << __lg(t) + __builtin_popcount(x) + cost + max(-s[mid], 0ll) << endl; 
        cmin(ans, __lg(t) + mxp(x, (id == unq ? t - 1 : vec[id + 1] - 1)) + cost + max(-s[mid], 0ll) );
        if(id == unq) break; 
        for(int i : tyl[id + 1]) {
            inc(c[i] - b[i]); 
        }
    }
    f(id, 0, unq) tyl[id].clear();  
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int T; cin >> T;
    while(T--) {
        ans = inf; 
        cin >> n; 
        f(i, 1, n) cin >> a[i]; 
        f(i, 1, n) cin >> b[i]; 
        int ub = 30; 
        //除法次数 [0, ub]
        f(t, 0, ub) {
            f(i, 1, n) c[i] = a[i] / (1 << t); 
            solve(1 << t); 
        }
        cout << ans << endl; 
    }
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}