#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long LL;


void solve()
{
	vector<vector<int>> q,q2,q3;
	int mark;
	for(int i = 0;i < 8;i ++)
	{
		vector<int> num;
		for(int j = 0;j < 4;j ++)
		{
			int x;
			cin>>x;
			if(i == 0&&j == 0) mark = x;
			num.push_back(x);	
		}
		sort(num.rbegin(),num.rend());
		q.push_back(num);
	}
	int len = q.size();
	for(int i = 0;i < len ;i++)//32->16;
	{
		while(q[i].size()>2) q[i].pop_back();
	}
	vector<int> qq;
	bool flag = false;
	for(int i = 0;i <q.size();i ++)
	{
		for(int j = 0;j < q[i].size();j ++)
		{
			qq.push_back(q[i][j]);
			if(q[i][j] == mark) flag = true;
			//cout<<q[i][j]<<endl;
		}
	}
	if(!flag)
	{
		cout<<32<<endl;
		return;
	}
	vector<int> pp1(8,0),pp2(8,0);
	pp1 = {qq[0],qq[3],qq[4],qq[7],qq[8],qq[11],qq[12],qq[15]};
	pp2 = {qq[1],qq[2],qq[5],qq[6],qq[9],qq[10],qq[13],qq[14]};
	int round = 16;
	for(int i = 0;i < 1;i++)
	{
		//cout<<"round:  "<<round<<endl;
		bool ok = false;
		vector<int> pp3,pp4;
		for(int j = 0;j < pp1.size();j += 2)
		{
			int xx = max(pp1[j],pp1[j + 1]);
			if(xx ==mark) ok = true;
			pp3.push_back(xx);
			//cout<<xx<<endl;
		}
		//cout<<endl;
		pp1 = pp3;
		pp3.clear();
		for(int j = 0;j < pp2.size();j +=2)
		{
			int xx = max(pp2[j],pp2[j + 1]);
			if(xx == mark) ok = true;
			pp4.push_back(xx);
			//cout<<xx<<endl;
		}
		pp2 = pp4;
		pp4.clear();
		if(!ok)
		{
			cout<<round<<endl;
			return ;
		}
		round /= 2;
		//cout<<endl<<endl;
	}
	int nn1 = pp1[0],nn2 = pp1[1],nn3 = pp2[0],nn4 = pp2[1];

	nn1 = max(nn1,nn2),nn3 = max(nn3,nn4);
	
	if(nn1 != mark && nn3 != mark) 
	{
		cout<<4<<endl;
		return;
	}
	nn1 = max(nn1,nn3);
	if(nn1 == mark)
	{
		cout<<1<<endl;
	}else
	{
		cout<<2<<endl;
	}
	
	
}

signed main()
{
	int n;
	cin>>n;
	for(int i = 0;i < n;i ++)
	{
		solve();
	}
	
}