#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int n;
ll ans;
vector<pii> q;
set<pii> S;
int L[] = {0, 5, 5, 5, 5, 1, 2, 3, 4, 5, 5, 5, 5, 5, 10, 11, 12, 13};
int R[] = {0, 5, 6, 7, 8, 13, 13, 13, 13, 13, 14, 15, 16, 17, 13, 13, 13, 13};

void bfs(int u) {
    set<pii> st;
    queue<pii> Q;
    st.insert(q[u]);
    Q.push(q[u]);
    while (Q.size()) {
        auto[x, y] = Q.front();
        Q.pop();
        auto get = [&](int p)->pii {
            auto[a, b] = q[p];
            int dx = a - x, dy = b - y;
            pii fail = {-1, -1};
            if (dx && dy && dx != dy) return fail;
            pii res = {a + dx, b + dy};
            if (res.x <= 0 || res.x > 17) return fail;
            if (res.y < L[res.x] || res.y > R[res.x]) return fail;
            if (S.count(res)) return fail;
            if (dx) dx = dx > 0 ? 1 : -1;
            if (dy) dy = dy > 0 ? 1 : -1;
            for (int i = x + dx, j = y + dy; i != res.x || j != res.y; i += dx, j += dy) {
                if (i == q[u].x && j == q[u].y) continue;
                if (i == a && j == b) continue;
                if (S.count({i, j})) return fail;
            }
            return res;
        };

        for (int i = 0; i < n; ++i) {
            if (i == u) continue;
            auto[a, b] = get(i);
            if (~a) {
                if (!st.count({a, b})) {
                    st.insert({a, b});
                    Q.push({a, b});
                }
            }
        }
    }
    // cout << st.size() << el;
    // for (auto[a, b]: st) cout << a << ' ' << b - L[a] + 1 << el;
    ans += st.size() - 1;
}

void solve() {
    n = read();
    q.clear();
    S.clear();
    for (int i = 0; i < n; ++i) {
        int x = read(), y = read();
        y += L[x] - 1;
        q.emplace_back(x, y);
        S.insert({x, y});
    }
    ans = 0;
    for (int i = 0; i < n; ++i) {
        bfs(i);
    }
    cout << ans << el;
}

int main() {
    int tcase;
    cin >> tcase;
    while (tcase--) solve();
}