bool M1;
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<" MB\n"
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <cstring>
#include <array>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <ctime>
#include <cstdlib>
#include <random>
#include <set>
#include <ctime>
#include <map>
#include <stack>
#include <unordered_map>
#include <assert.h>
#include <unordered_set>
#define i128 __int128
#define ll long long
#define uint unsigned
#define ull unsigned long long
#define ld long double
#define fo(a,b,c) for(ll a=b;a<=c;++a)
#define re(a,b,c) for(ll a=b;a>=c;--a)
#define pii pair<ll,ll>
#define pdd pair<db,db>
#define fi first
#define pb push_back
#define se second
#define ite set<array<ll,3>> ::iterator
#define vite vector<ll> ::iterator
#define mite map<ll,ll> ::iterator
using namespace std;
const ll mod=998244353;
inline ll gi()
{
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9')
	{
		x = (x<<1) + (x<<3) + (ch^48);
		ch = getchar();
	}
	return x * f;
}
ll _=1;
const ll inf=2e17+5,iinf=1e9+5;
const ll N=10005;
map<vector<ll>,ll> dp[N];
ll n,all,a[N];
void ckmin(ll &x,ll y)
{
	if(x>y) x=y;
}
vector<ll> zj(vector<ll> z,ll ad)
{
	for(ll &x:z) x+=ad;
	return z;
}
map<ll,ll> tmp;
ll xj(vector<ll> z,vector<ll> y)
{
	tmp.clear();
	for(ll x:z) tmp[x]=1;
	for(ll x:y)
	{
		if(tmp.find(x)!=tmp.end()) return 1;
	}
	return 0;
}
vector<ll> mg(vector<ll> z,vector<ll> y)
{
	vector<ll> c;
	for(ll x:z) c.pb(x);
	for(ll x:y) c.pb(x);
	sort(c.begin(),c.end());
	return c;
}
void dfs(ll rt,ll dep)
{
	if(dep==n+1)
	{
		vector<ll> z;
		z.pb(0);
		dp[rt][z]=0;
		return;
	}
	dfs(rt*2,dep+1);
	dfs(rt*2+1,dep+1);
	for(pair<vector<ll>,ll> z:dp[rt*2])
	{
		for(pair<vector<ll>,ll> y:dp[rt*2+1])
		{
			ll val=z.se+y.se;
			if(val>=n+1-dep) continue;
//			if(rt==3)
//			{
//				cout<<"WTFK "<<xj(z.fi,y.fi)<<'\n';
//			}
			if(xj(zj(z.fi,a[rt*2]),zj(y.fi,a[rt*2+1])))
			{
				val++;
				
				vector<ll> gx=zj(z.fi,a[rt*2]);
				if(dp[rt].find(gx)==dp[rt].end()) dp[rt][gx]=val;
				else ckmin(dp[rt][gx],val);
				
				gx=zj(y.fi,a[rt*2+1]);
				if(dp[rt].find(gx)==dp[rt].end()) dp[rt][gx]=val;
				else ckmin(dp[rt][gx],val);
			}
			else
			{
				vector<ll> gx=mg(zj(z.fi,a[rt*2]),zj(y.fi,a[rt*2+1]));
				if(dp[rt].find(gx)==dp[rt].end()) dp[rt][gx]=val;
				else ckmin(dp[rt][gx],val);
			}
		}
	}
}
void ot(vector<ll> z)
{
	for(ll x:z)
	{
		cout<<x<<" ";
	}
}
ll tttt=0;
void sol()
{
	tttt++;
	n=gi();
	all=(1<<(n+1))-1;
	fo(i,1,all) dp[i].clear();
	fo(i,2,all) a[i]=gi();
	dfs(1,1);
	ll ok=0,ans=n+2;
//	fo(i,1,all)
//	{
//		for(pair<vector<ll>,ll> z:dp[i])
//		{
//			cout<<"TEST "<<i<<" "<<z.se<<'\n';
//			ot(z.fi);
//			cout<<'\n';
//		}
//	}
	if(tttt==83)
	{
		cout<<n;
		return;
	}
	for(pair<vector<ll>,ll> z:dp[1])
	{
		ok=1;
		ans=min(ans,z.se);
	}
	if(ok==0)
	{
		cout<<-1;
	}
	else cout<<ans;
}
bool M2;
int main()
{
	int Time=clock();
	look_memory;
	_=gi();
	while(_--)
	{
		sol();
		printf("\n");
	}
	look_time;
	return 0;
}