#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

const int C = 1005;
typedef vector<vector<int>> M;

void add(M &v, int x1, int y1, int x2, int y2) {
    if (x1 > x2 || y1 > y2) return;
    v[x1][y1]++;
    v[x1][y2 + 1]--;
    v[x2 + 1][y1]--;
    v[x2 + 1][y2 + 1]++;
}

void intg(M &v) {
    for (int i = 1; i < C; i++)
        for (int j = 1; j < C; j++)
            v[i][j] += v[i - 1][j] + v[i][j - 1] - v[i - 1][j - 1];
}

ll c(ll a, ll b) {
    assert(b <= 3); 
    if (b > a) return 0;
    ll res = 1;
    for (int i = 0; i < b; i++)
        res *= (a - i);
    for (int i = 1; i <= b; i++)
        res /= i;
    return res;
}

void solve() {
    int n;
    cin >> n;
    M O(C, vector(C, 0));
    M U(C, vector(C, 0));
    M L(C, vector(C, 0));
    M LU(C, vector(C, 0));
    for (int i = 1; i <= n; i++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        add(LU, x1, y1, x1, y1);
        add(L, x1 + 1, y1, x2, y1);
        add(U, x1, y1 + 1, x1, y2);
        add(O, x1 + 1, y1 + 1, x2, y2);
    }
    intg(O); intg(U); intg(L); intg(LU);
    ll ans = 0;
    for (int o = 0; o <= 3; o++)
        for (int u = 0; o + u <= 3; u++)
            for (int l = 0; o + u + l <= 3; l++) {
                int lu = 3 - l - u - o; 
                if (lu || (u && l))
                    for (int i = 1; i < C; i++)
                        for (int j = 1; j < C; j++)
                            ans += c(O[i][j], o) * c(U[i][j], u) * c(L[i][j], l) * c(LU[i][j], lu);
            }
    cout << ans << endl;
}


int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        solve();
}