#include<bits/stdc++.h>
using namespace std;
int t,a[9],sum,c[10][2]={{0,0},{0,1},{0,2},{1,0},{1,1},{1,2},{2,0},{2,1},{2,2}};
bool b[9];
inline int read(){
	int k=0,f=1;
    char c=getchar();
	for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
	for(;isdigit(c);c=getchar()) k=(k<<1)+(k<<3)+c-'0';
	return k*f;
}
int dfs(int i,int x,int mo){
	if(i==sum+1){
		return x;
	}
	int manx=0;
	bool op=false;
	for(int j=1;j<=8;j++){
		if(a[j]==1&b[j]==0){
			b[j]=1;
			if(mo+c[a[j]][0]==3){
				x++;
				op=true;
			}
			manx=max(manx,dfs(i++,x,c[a[j]][1]));
			b[j]=0;
			if(op){
				x--;
				op=false;
			}
		}
	}
	return manx;
}
int main(){
	freopen("123.in","r",stdin);
	freopen("123.out","w",stdout);
	t=read();
	while(t--){
		int ans=0,maxn=0;
		for(int i=0;i<=8;i++){
			a[i]=read();
			sum+=a[i];
		}
		sum-=a[0];
		for(int i=1;i<=8;i++){
			b[i]=1;
			maxn=max(maxn,dfs(1,i,c[a[i]][1]));
			b[i]=0;
		}
		std::cout<<maxn<<endl;
	}
	return 0;
}