#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
#define int long long
using namespace std;
signed main()
{
	IOS;
	int t; cin >> t;
	while(t--)  
	{
		vector<int> a(33),id(33);
		for(int i = 1; i <= 32; ++i) 
		{
			cin >> a[i];
			id[i] = i;
		}
		int now = 32;
		sort(id.begin() + 1,id.end(),[&](int x,int y){return a[x] > a[y];});
		for(int i = 1; i <= 32; ++i) 
		{
			if(id[i] == 1) 
			{
				swap(id[i],id[32]);
				break;
			}
		}
		vector<array<int,2>> v(9);
		for(int i = 1; i <= 32; i += 4) 
		{
			sort(id.begin() + i,id.begin() + i + 4,[&](int x,int y) { return a[x] > a[y];});
			v[(i + 3) / 4] = {id[i],id[i+1]};
			if(id[i] == 1 || id[i+1] == 1) now = 16;
		}
		vector<int> z(9);
		for(int i = 1; i <= 8; ++i) z[i] = i;
		do
		{
			vector<int> g(9);
			for(int i = 1; i <= 8; i += 2) 
			{
				if(a[v[z[i]][0]] > a[v[z[i+1]][1]]) g[(i+1)/2] = v[z[i]][0];
				else g[(i+1)/2] = v[z[i+1]][1];

				if(a[v[z[i]][1]] > a[v[z[i+1]][0]]) g[4 + (i+1)/2] = v[z[i]][1];
				else g[4 + (i+1) / 2] = v[z[i+1]][0];
			}
			int len = 8;
			while(len >= 1) 
			{
				for(int i = 1; i <= len; ++i) if(g[i] == 1) now = min(now,len);
				for(int i = 1; i <= len; i += 2) 
				{
					if(a[g[i]] > a[g[i+1]]) g[(i+1)/2] = g[i];
					else g[(i+1) / 2] = g[i+1];
				}
				len /= 2;
			}
		}while(next_permutation(z.begin() + 1,z.end()));
		cout << now << endl;
	}	
	return 0;
}