#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int N = 30, M = 210;  // 17 * 13

int T, n, f[N][N], x[M], y[M], len[N];
bool vis[N][N], t[N][N];
queue<pii> que;

bool F(int x, int y) {
    return 1 <= x && x <= 17 && f[x][1] <= y && y <= f[x][len[x]] && (y & 1) == (f[x][1] & 1);
}

void Record(int x, int y, int f) {
    if (!F(x, y) || vis[x][y] || t[x][y] == f) return ;
    vis[x][y] = 1, que.push({x, y});
}

void bfs(int sx, int sy) {
    for (Record(sx, sy, 0); !que.empty(); ) {
        auto [x, y] = que.front(); que.pop();
        for (int k = 1; k <= 13; k++) {
            int nx = x + k, ny = y + k;
            if (F(nx, ny) && t[nx][ny]) {
                bool flag = 1;
                for (int tmp = k + 1; tmp <= 2 * k; tmp++) {
                    int tx = x + tmp, ty = y + tmp;
                    flag &= F(tx, ty) && !t[tx][ty];
                }
                if (flag) Record(nx + k, ny + k, 1);
                break;
            }
        }
        for (int k = 1; k <= 13; k++) {
            int nx = x - k, ny = y - k;
            if (F(nx, ny) && t[nx][ny]) {
                bool flag = 1;
                for (int tmp = k + 1; tmp <= 2 * k; tmp++) {
                    int tx = x - tmp, ty = y - tmp;
                    flag &= F(tx, ty) && !t[tx][ty];
                }
                if (flag) Record(nx - k, ny - k, 1);
                break;
            }
        }
        for (int k = 1; k <= 13; k++) {
            int nx = x - k, ny = y + k;
            if (F(nx, ny) && t[nx][ny]) {
                bool flag = 1;
                for (int tmp = k + 1; tmp <= 2 * k; tmp++) {
                    int tx = x - tmp, ty = y + tmp;
                    flag &= F(tx, ty) && !t[tx][ty];
                }
                if (flag) Record(nx - k, ny + k, 1);
                break;
            }
        }
        for (int k = 1; k <= 13; k++) {
            int nx = x + k, ny = y - k;
            if (F(nx, ny) && t[nx][ny]) {
                bool flag = 1;
                for (int tmp = k + 1; tmp <= 2 * k; tmp++) {
                    int tx = x + tmp, ty = y - tmp;
                    flag &= F(tx, ty) && !t[tx][ty];
                }
                if (flag) Record(nx + k, ny - k, 1);
                break;
            }
        }
        for (int k = 1; k <= 13; k++) {
            int nx = x, ny = y + 2 * k;
            if (F(nx, ny) && t[nx][ny]) {
                bool flag = 1;
                for (int tmp = k + 1; tmp <= 2 * k; tmp++) {
                    int tx = x, ty = y + 2 * tmp;
                    flag &= F(tx, ty) && !t[tx][ty];
                }
                if (flag) Record(nx, ny + k, 1);
                break;
            }
        }
        for (int k = 1; k <= 13; k++) {
            int nx = x, ny = y - 2 * k;
            if (F(nx, ny) && t[nx][ny]) {
                bool flag = 1;
                for (int tmp = k + 1; tmp <= 2 * k; tmp++) {
                    int tx = x, ty = y - 2 * tmp;
                    flag &= F(tx, ty) && !t[tx][ty];
                }
                if (flag) Record(nx, ny - k, 1);
                break;
            }
        }
    }
}

void Solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i], y[i] = f[x[i]][y[i]];
        t[x[i]][y[i]] = 1;
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        bfs(x[i], y[i]);
        for (int j = 1; j <= 17; j++) {
            for (int k = 1; k <= len[j]; k++) {
                ans += vis[j][f[j][k]];
                vis[j][f[j][k]] = 0;
            }
        }
    }
    for (int j = 1; j <= 17; j++) {
        for (int k = 1; k <= len[j]; k++) {
            t[j][f[j][k]] = 0;
        }
    }
    cout << ans - n << '\n';
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    f[1][1] = 13, f[2][1] = 12, f[3][1] = 11, f[4][1] = 10;
    f[5][1] = 1, f[6][1] = 2, f[7][1] = 3, f[8][1] = 4;
    f[9][1] = 5;
    f[10][1] = 4, f[11][1] = 3, f[12][1] = 2, f[13][1] = 1;
    f[14][1] = 10, f[15][1] = 11, f[16][1] = 12, f[17][1] = 13;
    for (int i = 1; i <= 17; i++) {
        for (int j = 2; j <= 13; j++) f[i][j] = f[i][j - 1] + 2;
    }
    len[1] = 1, len[2] = 2, len[3] = 3, len[4] = 4;
    len[5] = 13, len[6] = 12, len[7] = 11, len[8] = 10;
    len[9] = 9;
    len[10] = 10, len[11] = 11, len[12] = 12, len[13] = 13;
    len[14] = 4, len[15] = 3, len[16] = 2, len[17] = 1;
    cin >> T;
    while (T--) Solve();
    return 0;
}