#include <bits/stdc++.h>
using namespace std;
using ll =long long;
void solve(){
    int n;
    cin>>n;n++;
    vector<int> f(1<<n);
    for(int i=2;i<(1<<n);i++)   cin>>f[i];
    vector<map<int,int>> dp(1<<n);
    vector<ll> leaf(1<<n);
    for(int i=2;i<(1<<n);i++)   {
        leaf[i]=leaf[i/2]+f[i];
        if(i*2>=(1<<n)) {dp[i][leaf[i]]=1;}
    }
    int maxn=-1;
    int res=0;
    auto dfs=[&](auto self,int dep,int jl)->void {
        if(dep==-1) {
            if(maxn==-1||maxn>res)  maxn=res;
            return ;
        }
        vector<int> op;
        for(int i=(1<<dep);i<(1<<(dep+1));i++){
            bool fm=false;
            for(auto j:dp[i<<1]){
                if(dp[i<<1|1].count(j.first)){
                    op.push_back(i);
                    fm=true;
                    break;
                }
            }
            if(!fm){
                for(auto j:dp[i<<1])    dp[i][j.first]=1;
                for(auto j:dp[i<<1|1])    dp[i][j.first]=1;
            }
        }
        int sz=op.size();
        if(jl<sz)  return ;
        jl-=sz;res+=sz;
        for(int j=0;j<(1<<sz);j++){
            for(int k=0;k<sz;k++){
                if(j<<k&1)  for(auto j:dp[op[k]<<1])      dp[op[k]][j.first]=1;
                else   for(auto j:dp[op[k]<<1|1])    dp[op[k]][j.first]=1;
            }
            self(self,dep-1,jl+1);
            for(auto k:op)  dp[k].clear();
        } 
        res-=sz;
    };
    dfs(dfs,n-2,1);
    cout<<maxn<<'\n';
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    int _ =1;
    cin>>_;
    while(_--)  solve();
}