#pragma GCC optimize("-Ofast","-ffast-math","-funroll-all-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pl pair<ll, ll>
#define db double
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int T;
int s[17][2]={
{0,0},
{0,1},
{0,2},
{0,3},
{-4,8},
{-3,8},
{-2,8},
{-1,8},
{0,8},
{0,9},
{0,10},
{0,11},
{0,12},
{5,8},
{6,8},
{7,8},
{8,8}
};
int n,f[20][20],g[20][20],ans=0,V=0;
int dx[]={0,1,1,0,-1,-1},dy[]={1,0,1,-1,0,-1};
void dfs(int x,int y) {
    if(g[x][y]==V) return;
    g[x][y]=V; ++ans;
    for(int d=0;d<6;++d) {
        int xx=x,yy=y,go=0;
        while(1) {
            xx+=dx[d],yy+=dy[d];
            if(xx>=0&&xx<=16&&yy>=s[xx][0]&&yy<=s[xx][1]);
            else break;
            if(f[xx][yy]) {go=1; break;}
        }
        if(!go) continue;
        int x2=xx*2-x,y2=yy*2-y;
        if(x2>=0&&x2<=16&&y2>=s[x2][0]&&y2<=s[x2][1]&&!f[x2][y2]) dfs(x2,y2);
    }
}
void sol() {
    cin>>n;
    memset(f,0,sizeof f);
    for(int i=0;i<n;++i) {
        int x,y;
        cin>>x>>y;
        --x;
        y=y-1+s[x][0];
        f[x][y]=1;
    }
    ans=0;
    for(int i=0;i<20;++i)
        for(int j=0;j<20;++j) if(f[i][j]==1){
            f[i][j]=0; ++V; --ans;
            dfs(i,j);
            // cout<<i<<","<<j<<":"<<ans<<" "<<s[i][0]<<","<<s[i][1]<<"\n";
            f[i][j]=1;
        }
    printf("%d\n",ans);
}
int main() {
    int aa=0;
    for(int i=0;i<=16;++i) s[i][0]+=4,s[i][1]+=4,aa+=s[i][1]-s[i][0]+1;
    // cout<<aa<<"\n";
    cin>>T;
    while(T--) sol();
}