#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 18;
const int dx[6] = {0, 0, 1, 1, -1, -1};
const int dy[6] = {1, -1, 0, 1, 0, -1};

queue <pii> q;
int a[N][N], b[N][N], x[N * N], y[N * N];
int T, n;

bool in(int x, int y) {
    if (x < 1 || x > 17) return 0;
    if (x >= 1 && x <= 4) return y >= 1 && y <= x;
    if (x >= 5 && x <= 9) return y >= x - 8 && y <= 9;
    if (x >= 10 && x <= 13) return y >= 1 && y <= x;
    return y >= x - 8 && y <= 8;
}

int chk(int x, int y) {
    if (x < 1 || x > 17) return 0;
    if (x >= 1 && x <= 4) return y >= 1 && y <= x && a[x][y + 4] == 0;
    if (x >= 5 && x <= 9) return y >= x - 8 && y <= 9 && a[x][y + 4] == 0;
    if (x >= 10 && x <= 13) return y >= 1 && y <= x && a[x][y + 4] == 0;
    return y >= x - 8 && y <= 8 && a[x][y + 4] == 0;
}

int main() {
    read(T);
    while (T--) {
        memset(a, 0, sizeof(a));
        read(n);
        for (int i = 1; i <= n; i++) {
            read(x[i]); read(y[i]);
            if (x[i] >= 5 && x[i] <= 8) y[i] -= (9 - x[i]);
            if (x[i] >= 14) y[i] += x[i] - 9;
            a[x[i]][y[i] + 4] = 1;
        }
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            memset(b, 0, sizeof(b));
            a[x[i]][y[i] + 4] = 0;
            q.push(make_pair(x[i], y[i])); b[x[i]][y[i] + 4] = 1;
            --ans;
            while (!q.empty()) {
                pii t = q.front(); q.pop(); ++ans;
                for (int d = 0; d < 6; d++) {
                    int pos = 0;
                    for (int i = 1; ; i++) {
                        if (!in(t.first + dx[d] * i * 2, t.second + dy[d] * i * 2)) break;
                        if (a[t.first + dx[d] * i][t.second + dy[d] * i + 4]) {
                            pos = i;
                            break;
                        }
                    }
                    if (pos && !b[t.first + dx[d] * pos * 2][t.second + dy[d] * pos * 2 + 4]) {
                        int ok = 1;
                        for (int i = 0; i < pos; i++) {
                            if (a[t.first + dx[d] * (pos * 2 - i)][t.second + dy[d] * (pos * 2 - i) + 4]) {
                                ok = 0;
                                break;
                            }
                        }
                        if (ok) {
                            b[t.first + dx[d] * pos * 2][t.second + dy[d] * pos * 2 + 4] = 1;
                            q.push(make_pair(t.first + dx[d] * pos * 2, t.second + dy[d] * pos * 2));
                        }
                    }
                }
            }
            a[x[i]][y[i] + 4] = 1;
        }
        print(ans, '\n');
    }
    return 0;
}