#include <bits/stdc++.h>

#define forn(i,n) for(int i=0; i < n; ++i)
#define for1(i,n) for(int i=1; i <= n; ++i)
#define fore(i,l,r) for(int i=l; i <= r; ++i)
#define pb push_back
#define el '\n'
#define fi first
#define se second
#define sz(v) int(v.size())
#define D(v) cout << #v << " : " << v << el;

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
vi st{ 4, 4, 4, 4, 0,  1,  2,  3,  4,  3,  2,  1,  0, 5, 6, 7, 8 };
vi an{ 1, 2, 3, 4, 13, 12, 11, 10, 9, 10, 11, 12, 13, 4, 3, 2, 1};
vii pos;
typedef array<int, 3> i3;
set<i3> dp;
int g[30][30];

bool check(int i, int j){
  if(i < 0 || i >= sz(st)) return 0;
  return st[i] <= j && j < st[i] + an[i];
}

vector<ii> dir{
  {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {-1, -1}
};

void dfs(i3 cur){
  if(dp.count(cur)) return;
  dp.insert(cur);
  i3 pre = cur;
  auto [idx, i, j] = cur;
  // D(idx); D(i); D(j); cout << el;
  for(auto&[di, dj]: dir){
    int ni = i, nj = j, iters = 0;
    bool melo = 0;
    while(++iters){
      ni += di,  nj += dj;
      if(!check(ni, nj)) break;
      if(g[ni][nj]){
        melo = 1; break;
      }
    }
    if(melo){
      forn(it, iters){
        ni += di,  nj += dj;
        if(!check(ni, nj) || (g[ni][nj] && it < iters-1)){
          melo = 0; break;
        }
      }
      // D(iters); D(check(ni, nj));D(g[ni][nj]);
      if(melo && !g[ni][nj]){
        dfs({idx, ni, nj});
      }
    }
  }
  // cur = pre;
}

int main(){
  ios_base::sync_with_stdio(0); cin.tie(0);
  int t; cin >> t;
  while(t--){
    int n; cin >> n;
    pos.resize(n);
    forn(i, n){
      int r, c; cin >> r >> c;
      --r, --c;
      pos[i] = {r, st[r] + c};
      g[r][st[r]+c] = i+1;
    }

    forn(i, n){
      g[pos[i].fi][pos[i].se] = 0;
      i3 cur{i+1, pos[i].fi, pos[i].se};
      dfs(cur);
      g[pos[i].fi][pos[i].se] = i+1;
    }
    cout << sz(dp) - n << el;
    dp.clear();
    forn(i, 30) forn(j, 30) g[i][j] = 0;
  }
}