#include<bits/stdc++.h>
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
#define maxn 1234567
#define eps 1e-7
#define mod 1000000007
#define Mod 998244353
#define f(i,a,b) for(int i=a;i<=b;i++)
#define r(i,a,b) for(int i=a;i>=b;i--) 
#define fx(i,a,b,x) for(int i=a;i<=b;i+=x)
#define rx(i,a,b,x) for(int i=a;i>=b;i-=x) 
using namespace std;
int T;
int l,a[7][7],b[7][7],flg,ans;
int check(int a,int b,int c){
	if(a==c)return 0;
	if(a>b&&c>b)return 1;
	if(a<b&&c<b)return 1;
	return 0;
}
void solve(){
	scanf("%lld",&l);
	f(i,1,3)
		f(j,1,3)scanf("%lld",&a[i][j]);
	ans=0;
	f(L,1,l-1){
		flg=0;
		f(i,1,3){
			f(j,1,3){
				b[i][j]=a[i][j];
				if(b[i][j]==0){
					if(flg==1)b[i][j]=l-L;
					else b[i][j]=L,flg=1;
				}
			}
		}
		if(check(b[1][1],b[1][2],b[1][3])==1&&check(b[2][1],b[2][2],b[2][3])==1&&check(b[3][1],b[3][2],b[3][3])==1&&check(b[1][1],b[2][1],b[3][1])==1&&check(b[1][2],b[2][2],b[3][2])==1&&check(b[1][3],b[2][3],b[3][3])==1&&check(b[1][1],b[2][2],b[3][3])==1&&check(b[1][3],b[2][2],b[3][1])==1)ans++;
	}
	printf("%lld\n",ans);
}
signed main(){
//	T=1; f
	scanf("%lld",&T);
	while(T--)solve();
	return 0;
}