#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int cnt[20]={0,1,2,3,4,13,12,11,10,9,10,11,12,13,4,3,2,1};
int st[20]={0,11,11,11,11,7,8,9,10,11,11,11,11,11,16,17,18,19};
int id1[20][15],id2[30][30],vis[125],x[125],y[125],f[30][30];
int px[125],py[125];
int dy[6]={0,-1,-1,0,1,1},dx[6]={1,1,0,-1,-1,0};
int main() {
    memset(id1,-1,sizeof(id1)),memset(id2,-1,sizeof(id2));
    for(int i=1,now=0;i<=19;i++){
        for(int j=1;j<=cnt[i];j++){
            now++;
            id1[i][j]=now;
            id2[j+st[i]-1][24-i+1]=now;
            x[now]=j+st[i]-1,y[now]=24-i+1;
        }
    }
    int T = 1, kase = 0;
    cin >> T;
    while (T--) {
        memset(f,0,sizeof(f));
        int n,ans=0;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d%d",&px[i],&py[i]),f[x[id1[px[i]][py[i]]]][y[id1[px[i]][py[i]]]]=1;
            //cout<<x[id1[px[i]][py[i]]]<<" "<<y[id1[px[i]][py[i]]]<<endl;
        }
        for(int i=1;i<=n;i++){
            memset(vis,-1,sizeof(vis));
            queue <pair<int,int>> q;
            vis[id1[px[i]][py[i]]]=1;
            int stx=x[id1[px[i]][py[i]]],sty=y[id1[px[i]][py[i]]];
            assert(id2[stx][sty]==id1[px[i]][py[i]]);
            q.push({x[id1[px[i]][py[i]]],y[id1[px[i]][py[i]]]});
            while(!q.empty()){
                auto temp=q.front();
                q.pop();
                for(int j=0;j<6;j++){
                    int tx=-1,ty=-1;
                    for(int xx=temp.first+dx[j],yy=temp.second+dy[j];id2[xx][yy]!=-1;xx+=dx[j],yy+=dy[j]){
                        if(f[xx][yy]&&(xx!=stx||yy!=sty)){
                            tx=xx,ty=yy;
                            break;
                        }
                    }
                    if(tx!=-1){
                        int ox=tx*2-temp.first,oy=ty*2-temp.second;
                        if(ox<=0||oy<=0||ox>29||oy>29||id2[ox][oy]==-1) continue;
                        int fl=1;
                        for(int xx=tx+dx[j],yy=ty+dy[j];;xx+=dx[j],yy+=dy[j]){
                            if(f[xx][yy]) fl=0;
                            if(xx==ox) break;
                        }
                        if(fl&&vis[id2[ox][oy]]==-1){
                            //cout<<i<<" "<<temp.first<<" "<<temp.second<<" "<<tx<<" "<<ty<<" "<<ox<<" "<<oy<<" "<<f[ox][oy]<<endl;
                            vis[id2[ox][oy]]=1,ans++,q.push({ox,oy});
                        }
                    }
                }
            }
            //cout<<i<<" "<<ans<<endl;
        }
        cout<<ans<<endl;
    }
    return 0;
}