/// UH Top
#include <bits/stdc++.h>
#define db(x)   cerr << #x << ':' << (x) << '\n';
#define all(v)  (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
// #define int ll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
// typedef __int128_t int128;
typedef pair<ll, ll> pii;
typedef pair<ld, ll> pdi;
typedef pair<ld, ld> pdd;
typedef pair<ld, pdd> pdp;
typedef pair<string, ll> psi;
typedef pair<ll, string> pls;
typedef pair<string, string> pss;
typedef pair<ll, pii> pip;
typedef pair<pii, pii> ppp;
typedef complex<ld> point;
typedef vector<point> polygon;
typedef vector<ll> vi;
typedef pair<point, int> ppi;
#define prec(n)                                                                \
	cout.precision(n);                                                         \
	cout << fixed
const ll mod = (1e9 + 7);
const ld eps = (1e-9);
const ll oo = (ll)(1e18 + 5);
#define pi   acos(-1)
#define MAXN (ll)(1e3 + 5)

int tot[MAXN][MAXN];
int r[MAXN][MAXN];
int d[MAXN][MAXN];
int f[MAXN][MAXN];

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		for (int i = 0; i < MAXN; i++)
			for (int j = 0; j < MAXN; j++)
				tot[i][j] = r[i][j] = d[i][j] = f[i][j] = 0;
		for (int i = 0; i < n; i++) {
			int x1, y1, x2, y2;
			cin >> x1 >> y1 >> x2 >> y2;
			f[x1][y1]++;
			r[x1][y1]++;
			r[x1][y2 + 1]--;
			d[x1][y1]++;
			d[x2 + 1][y1]--;
			tot[x1][y1]++;
			tot[x1][y2 + 1]--;
			tot[x2 + 1][y1]--;
			tot[x2 + 1][y2 + 1]++;
		}

		ll ans = 0;
		for (int i = 1; i < MAXN; i++)
			for (int j = 1; j < MAXN; j++) {
				r[i][j] += r[i][j - 1];
				d[i][j] += d[i - 1][j];
				tot[i][j] +=
				    (tot[i - 1][j] + tot[i][j - 1] - tot[i - 1][j - 1]);

				ll c3 = f[i][j];
				ll c2 = r[i][j] - f[i][j];
				ll c1 = d[i][j] - f[i][j];
				ll c0 = tot[i][j] - c1 - c2 - c3;
				ans += (c3 * (c3 - 1) * (c3 - 2)) / 6;
				ans += (c3 * (c3 - 1) * (c0 + c1 + c2)) / 2;
				ans += (c3 * (c0 + c1 + c2) * ((c0 + c1 + c2) - 1)) / 2;
				ans += (c1 * (c1 - 1) * c2) / 2;
				ans += (c1 * c2 * (c2 - 1)) / 2;
				ans += (c0 * c1 * c2);
			}

		cout << ans << "\n";
	}

	return 0;
}