#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
const int N=2100;
int n,len,a[N],vis[N],cut[N];
long long deep[N];
map<long long,vector<int> > las;
int dfs(int u,int nowans){
    //cerr<<u<<' '<<nowans<<'\n';
    if(u==len-(1<<n)){
        return nowans;
    }
    
        while(las[deep[u]].size()){
            int v=las[deep[u]].back();
            int uu=u,vv=v,flag=0;
            while(uu!=vv){
                if(cut[uu]){
                    las[deep[u]].push_back(u);
                    int ans=dfs(u-1,nowans);
                    las[deep[u]].pop_back();
                    return ans;
                }
                else if(cut[vv]){
                    las[deep[u]].pop_back();
                    flag=1;
                    break;
                }
                uu=((uu+1)>>1)-1;
                vv=((vv+1)>>1)-1;
            }
            if(!flag)break;
        }

    if(!las[deep[u]].size()){
        las[deep[u]].push_back(u);
        int ans=dfs(u-1,nowans);
        if(las[deep[u]].back()==u)las[deep[u]].pop_back();
        return ans;
    }
    else{
        int v=las[deep[u]].back();
        //cerr<<u<<' '<<v<<'\n';
        int uu=u,vv=v;
        vector<pair<int,int> > vec;
        while(uu!=vv){
            vec.push_back(make_pair(uu,vv));
            uu=((uu+1)>>1)-1;
            vv=((vv+1)>>1)-1;
        }
        for(int i=vec.size()-1;i>=0;i--)
            if(!vis[i]){
                int ans=-1;
                {
                    int node=vec[i].first;
                    vis[i]=1;
                    cut[node]=1;     
                    las[deep[u]].push_back(u);          
                    ans=dfs(u-1,nowans+1);
                    if(las[deep[u]].back()==u)las[deep[u]].pop_back();
                    cut[node]=0;
                    vis[i]=0;
                }

                {
                    int node=vec[i].second;
                    vis[i]=1;
                    cut[node]=1; 
                    las[deep[u]].push_back(u);              
                    int now=dfs(u-1,nowans+1);
                    if(ans==-1)ans=now;
                    else if(now!=-1)ans=min(ans,now);
                    if(las[deep[u]].back()==u)las[deep[u]].pop_back();
                    cut[node]=0;
                    vis[i]=0;  
                }   
                return ans;
            }
    }
    return -1;
}
int main(){
    int T;scanf("%d",&T);
    while(T--){
        las.clear();
        scanf("%d",&n);
        len=(1<<(n+1))-2;
        for(int i=1;i<=len;i++)   
            scanf("%d",&a[i]);
        for(int i=1;i<=len;i++)
            deep[i]=deep[((i+1)>>1)-1]+a[i];
        cout<<dfs(len,0)<<'\n';
        for(int i=0;i<=n;i++)vis[i]=0;
    }    
    return 0;
}