#include <set>#include <map>#include <queue>#include <stack>#include <math.h>#include <stdio.h>#include <stdlib.h>#include <iostream>#include <limits.h>#include <string.h>#include <string>#include <algorithm>#define MId(x,y) ( ( x + y ) >> 1 )#define L(x) ( x << 1 )#define R(x) ( x << 1 | 1 )#define FOR(i,s,t) for(int i=(s); i<(t); i++)using namespace std;const int MAX = 8010*2;struct Tnode{ int l,r,id; int len() { return r - l;} int mid() { return MId(l,r);} bool in(int ll,int rr) { return l >= ll && r <= rr; } void lr(int ll,int rr){ l = ll; r = rr;}};Tnode node[MAX<<2];vector< vector<int> > v(MAX/2);vector< int >::iterator it;void Build(int t,int l,int r){node[t].lr(l,r);node[t].id = -1; if( node[t].len() == 1 )return ;int mid = MId(l,r);Build(L(t),l,mid);Build(R(t),mid,r);}void Updata_id(int t){if( node[L(t)].id == node[R(t)].id && node[L(t)].id != -2 )node[t].id = node[L(t)].id;elsenode[t].id = -2;}void Push_down(int t){if( node[t].len() == 1 )return ;if( node[t].id >= 0 )node[L(t)].id = node[R(t)].id = node[t].id;}void Updata(int t,int l,int r,int id){Push_down(t);if( node[t].in(l,r) && node[t].id != -2 ){if( node[t].id != -1 )v[node[t].id].push_back(id);node[t].id = id;return ;}if( node[t].len() == 1 ) return ;int mid = node[t].mid();if( l < mid ) Updata(L(t),l,r,id);if( r > mid ) Updata(R(t),l,r,id);Updata_id(t);}struct NODE{int x, y, id, xx;void get(){scanf("%d%d%d", &x, &y, &xx);}};NODE a[MAX/2];bool cmp(NODE a,NODE b){return a.xx < b.xx;}int solve(int n){int sum = 0;Build(1, 0, MAX);FOR(i, 0, n){v[i].clear();Updata(1, a[i].x*2, a[i].y*2+1, a[i].id);}FOR(i, 0, n){sort(v[i].begin(), v[i].end());it = unique(v[i].begin(), v[i].end());v[i].resize( it - v[i].begin());}FOR(i, 0, n){int len = v[i].size();FOR(k, 0, len){FOR(j, k+1, len) {int a = v[i][k];int b = v[i][j];if( binary_search(v[a].begin(), v[a].end(), b) )sum++;}}}return sum;}int main(){int ncases, n;scanf("%d", &ncases);while( ncases-- ){scanf("%d", &n);FOR(i, 0, n)a[i].get();sort(a, a+n, cmp);FOR(i, 0, n)a[i].id = i;int ans = solve(n);printf("%dn", ans);} return 0;}
