#include<bits/stdc++.h>
using namespace std;

const int MAXT=100,MAXN=121;

int T,n,X[MAXN+5],Y[MAXN+5];
int L[20],R[20],ans;//17*17
int row[20][20],col[20][20],lea[20][20];

inline int Trans(int x,int y)
{
	if(y<=4 || (10<=y && y<=13)) return x+4;
	return x+y-5;
}
inline int Count(int y)
{
	if(y<=4 || (10<=y && y<=13)) return y;
	return 18-y;
}

inline int rsum(int y,int L,int R)
{
	if(L==R) return 0;
	if(L>R) swap(L,R);
	return row[y][R-1]-row[y][L];
}
inline int csum(int x,int L,int R)
{
	if(L==R) return 0;
	if(L>R) swap(L,R);
	return col[x][R-1]-col[x][L];
}
inline int lsum(int b,int L,int R)
{
	if(L==R) return 0;
	if(L>R) swap(L,R);
	return lea[b][R-1]-lea[b][L];
}

bool V[20][20];
int DFS(int x,int y)
{
	int res=0;
	for(int i=1,rx,ry;i<=n;i++)
		if(X[i]==x || Y[i]==y || Y[i]-X[i]==y-x)
		{
			ry=2*Y[i]-y;
			if(ry<1 || 17<ry) continue;
			rx=2*X[i]-x;
			if(rx<L[ry] || R[ry]<rx) continue;
			if(rx==x && csum(x,y,ry)>1) continue;
			if(ry==y && rsum(y,x,rx)>1) continue;
			if(ry-rx==y-x && lsum(y-x+9,x,rx)>1) continue;
			if(V[ry][rx]) continue;
			V[ry][rx]=1,res+=DFS(rx,ry)+1;
		}
	return res;
}

int main()
{
	for(int i=1;i<=17;i++) L[i]=Trans(1,i),R[i]=Trans(Count(i),i);
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(int i=1;i<=17;i++)
			for(int j=1;j<=17;j++)
				row[i][j]=col[i][j]=lea[i][j]=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d %d",&Y[i],&X[i]);
			X[i]=Trans(X[i],Y[i]);
			++row[Y[i]][X[i]],++col[X[i]][Y[i]],++lea[Y[i]-X[i]+9][X[i]];
		}
		for(int i=1;i<=17;i++)
			for(int j=1;j<=17;j++)
				row[i][j]+=row[i][j-1],col[i][j]+=col[i][j-1],lea[i][j]+=lea[i][j-1];
		ans=0;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=17;j++)
				for(int k=1;k<=17;k++)
					V[j][k]=0;
			for(int j=1;j<=n;j++) V[Y[j]][X[j]]=1;
			Y[i]-=17;
			ans+=DFS(X[i],Y[i]+17);
			Y[i]+=17;
		}
		printf("%d\n",ans);
	}
	return 0;
}