#include <bits/stdc++.h>

using i64 = long long;

constexpr int M = 1000;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> x1(n), y1(n), x2(n), y2(n);
    for (int i = 0; i < n; i++) {
        std::cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
        x1[i]--, y1[i]--;
    }
    i64 ans = 0;
    for (int fx = 0; fx <= 1; fx++) {
        for (int fy = 0; fy <= 1; fy++) {
            std::vector a(M + 1, std::vector<int>(M + 1));
            for (int i = 0; i < n; i++) {
                a[x1[i]][y1[i]] += 1;
                a[x1[i]][y2[i] - fy] -= 1;
                a[x2[i] - fx][y1[i]] -= 1;
                a[x2[i] - fx][y2[i] - fy] += 1;
            }
            for (int i = 0; i <= M; i++) {
                for (int j = 1; j <= M; j++) {
                    a[i][j] += a[i][j - 1];
                }
            }
            for (int i = 1; i <= M; i++) {
                for (int j = 0; j <= M; j++) {
                    a[i][j] += a[i - 1][j];
                }
            }
            for (int i = 0; i < M; i++) {
                for (int j = 0; j < M; j++) {
                    ans += 1LL * a[i][j] * (a[i][j] - 1) * (a[i][j] - 2) / 6 * (fx ^ fy ? -1 : 1);
                }
            }
        }
    }
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}