#include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<queue>

 #include<map>

 using namespace std;

 #define MOD 1000000007

 const int INF=0x3f3f3f3f;

 const double eps=1e-;

 #define cl(a) memset(a,0,sizeof(a))

 #define ts printf("*****\n");

 #define lson l,mid,rt<<1

 #define rson mid+1,r,rt<<1|1

 #define root 1,n,1

 #define mid ((l+r)>>1)

 const int MAXN=;

 int n,m,t,Min,tt;

 int sum[MAXN<<],col[MAXN<<],hash[MAXN];

 vector<int> v[MAXN];

 struct node

 {

     int s,t,x;

     void in()

     {

         scanf("%d%d%d",&s,&t,&x);

         s<<=,t<<=;

     }

 }a[MAXN];

 bool cmp(node A,node B)

 {

     return A.x<B.x;

 }

 void pushdown(int rt)

 {

     if(col[rt]!=-)

     {

         col[rt<<]=col[rt<<|]=col[rt];

         col[rt]=-;

     }

 }

 void update(int L,int R,int val,int l,int r,int rt)

 {

     if(l>=L&&r<=R)

     {

         col[rt]=val;

         return;

     }

     pushdown(rt);

     if(L<=mid) update(L,R,val,lson);

     if(R>mid) update(L,R,val,rson);

 }

 void query(int L,int R,int val,int l,int r,int rt){

     if(col[rt]!=-){

         if(hash[col[rt]]!=val){ //防止重复覆盖

             v[col[rt]].push_back(val);

             hash[col[rt]]=val;

         }

         return ;

     }

     if(l==r) return ;

     pushdown(rt);

     if(L<=mid) query(L,R,val,lson);

     if(R>mid)  query(L,R,val,rson);

 }

 int main()

 {

     int i,j,k;

     #ifndef ONLINE_JUDGE

     freopen("1.in","r",stdin);

     #endif

     scanf("%d",&tt);

     while(tt--)

     {

         memset(col,-,sizeof(col));

         memset(hash,-,sizeof(hash));

         scanf("%d",&n);

         for(i=;i<n;i++)

         {

             a[i].in();

             v[i].clear();

         }

         sort(a,a+n,cmp);

         for(i=;i<n;i++)

         {

             query(a[i].s,a[i].t,i,,,);

             update(a[i].s,a[i].t,i,,,);

         }

         for(i=;i<n;i++)

         {

             sort(v[i].begin(), v[i].end());         //v[i]储存的是i号结点所能看到的线段编号

         }

         int tot=;

         for(i=;i<n;i++)

         {

             int len=v[i].size();

             for(j=;j<len;j++)

             {

                 for(k=j+;k<len;k++)

                 {

                     int a1=v[i][j];

                     int a2=v[i][k];

                     if(binary_search(v[a1].begin(),v[a1].end(),a2)) tot++;

                 }

             }

         }

         printf("%d\n",tot);

     }

 }