/*
You are my reason to be
*/
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#ifdef ONLINE_JUDGE
	#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
	char buf[1<<21],*p1=buf,*p2=buf;
#endif
using namespace std;typedef long long ll;int read(){int num=0,f=1;char c;while(!isdigit(c=getchar()))if(c=='-')f=-1;while(isdigit(c))num=num*10+(c&15),c=getchar();return num*f;}void write(ll x,char ch=' '){int F[20],cnt=0;if(!x)putchar('0');if(x<0)putchar('-'),x=-x;while(x)F[cnt++]=x%10+'0',x/=10;while(cnt)putchar(F[--cnt]);putchar(ch);}
namespace Main
{
    const int N=800010,K=200010;int n,m,k,q,t,suf[N],pre[N],lshx[N],lshy[N];ll x,y,z,xx,yy,zz,d[K],S;vector<int>E[N];vector<pair<int,int>>e[N];struct tr{int x,y,z;}c[N];bool operator<(tr x,tr y){return x.x<y.x;}struct nd{int x,y,l,r,id;}b[K],a[N];bool cmpx(nd&x,nd&y){return x.x<y.x;}bool cmpy(nd&x,nd&y){return x.y<y.y;}bool cmpY(nd&x,nd&y){return x.y>y.y;}bool cmpl(nd&x,nd&y){return x.l<y.l;}bool cmpr(nd&x,nd&y){return x.r<y.r;}bool chk(nd&x,nd&y){return min(x.y,y.y)<max(x.x,y.x)||min(x.r,y.r)<max(x.l,y.l);}
    struct bit{int tr[N],n;void clr(int t){memset(tr,0,(n+1)<<2),n=t;}void upd(int x){for(;x<=n;x+=x&-x)++tr[x];}void upd(int x,int z){for(;x<=n;x+=x&-x)tr[x]+=z;}int sum(int x){int res=0;for(;x;x^=x&-x)res+=tr[x];return res;}int sum(int x,int y){return sum(y)-sum(x-1);}}A,B;void output(int*a,int n){putchar('#');for(int i=1;i<=n;++i)write(a[i]," \n"[i==n]);}void output(ll*a,int n){putchar('#');for(int i=1;i<=n;++i)write(a[i]," \n"[i==n]);}
    void lsh(){k=q=0;for(int i=1;i<=m;++i)lshx[++k]=a[i].x,lshx[++k]=a[i].y,lshy[++q]=a[i].l,lshy[++q]=a[i].r;sort(lshx+1,lshx+k+1),k=unique(lshx+1,lshx+k+1)-lshx-1,sort(lshy+1,lshy+q+1),q=unique(lshy+1,lshy+q+1)-lshy-1;for(int i=1;i<=m;++i)a[i].x=lower_bound(lshx+1,lshx+k+1,a[i].x)-lshx,a[i].y=lower_bound(lshx+1,lshx+k+1,a[i].y)-lshx,a[i].l=lower_bound(lshy+1,lshy+q+1,a[i].l)-lshy,a[i].r=lower_bound(lshy+1,lshy+q+1,a[i].r)-lshy;}
    void cal(bool op){memset(suf,0,(k+2)<<2),memset(pre,0,(k+1)<<2);for(int i=1;i<=m;++i)++suf[a[i].x],++pre[a[i].y];for(int i=1;i<=k;++i)pre[i]+=pre[i-1];for(int i=k;i;--i)suf[i]+=suf[i+1];for(int i=1;i<=m;++i)d[a[i].id]+=pre[a[i].x-1]+suf[a[i].y+1];
    if(op){sort(a+1,a+m+1,cmpx),A.clr(q),B.clr(q);for(int i=1;i<=k;++i)E[i].clear();for(int i=1;i<=m;++i)E[a[i].y+1].push_back(i);for(int i=1,x=1;i<=k&&x<=m;++i){for(auto j:E[i])A.upd(a[j].r),B.upd(a[j].l);for(;x<=m&&a[x].x==i;++x)d[a[x].id]-=A.sum(a[x].l-1)+B.sum(a[x].r+1,q);}
    sort(a+1,a+m+1,cmpY),A.clr(q),B.clr(q);for(int i=1;i<=k;++i)E[i].clear();for(int i=1;i<=m;++i)E[a[i].x-1].push_back(i);for(int i=k,x=1;i&&x<=m;--i){for(auto j:E[i])A.upd(a[j].r),B.upd(a[j].l);for(;x<=m&&a[x].y==i;++x)d[a[x].id]-=A.sum(a[x].l-1)+B.sum(a[x].r+1,q);}}for(int i=1;i<=m;++i)swap(a[i].x,a[i].l),swap(a[i].y,a[i].r);swap(k,q);}
    ll C(int z,int x){return (x<=1?(x?z:1):(x==3?(z-1ll)*(z-2ll)*z/6:z*(z-1ll)/2));}namespace sgt{struct nd2{ll a[4];ll&operator[](int x){return a[x];}void clr(){memset(a,0,sizeof(a)),a[0]=1;}/*void operator=(int x){for(int i=0;i<4;++i)a[i]=C(x,i);}*/void operator+=(int z){for(int i=4;i--;)for(int j=0;j<i;++j)a[i]+=a[j]*C(z,i-j);}}v[N<<2];nd2 operator+(nd2&x,nd2&y){nd2 z;for(int i=0;i<4;++i)z[i]=x[i]+y[i];return z;}int tag[N<<2];void pushup(int k){v[k]=v[k<<1]+v[k<<1|1];}void build(int k,int l,int r){tag[k]=0;if(l==r)v[k].clr();else{int mid=(l+r)>>1;build(k<<1,l,mid),build(k<<1|1,mid+1,r),pushup(k);}}void U(int k,int z){tag[k]+=z,v[k]+=z;}void pushdown(int k){if(tag[k])U(k<<1,tag[k]),U(k<<1|1,tag[k]),tag[k]=0;}
    void upd(int k,int l,int r,int L,int R,int z){/*if(l==1&&r==q)printf("#%d %d %d\n",L,R,z);*/if(L<=l&&r<=R)U(k,z);else{int mid=(l+r)>>1;pushdown(k);if(L<=mid)upd(k<<1,l,mid,L,R,z);if(mid<R)upd(k<<1|1,mid+1,r,L,R,z);pushup(k);}}ll qry(int k,int l,int r,int L,int R){if(L<=l&&r<=R)return v[k][3];int mid=(l+r)>>1;return pushdown(k),(L<=mid?qry(k<<1,l,mid,L,R):0)+(mid<R?qry(k<<1|1,mid+1,r,L,R):0);}}
    ll calc(int xx,int yy){ll res=0;/*for(int i=1;i<=n;++i)a[i].x=b[i].x,a[i].y=b[i].y-xx,a[i].l=b[i].l,a[i].r=b[i].r-yy;*/for(int i=1;i<=n;++i){if(xx)swap(a[i].y,a[i+n].y);if(yy)swap(a[i].r,a[i+n].r);}sgt::build(1,1,q);for(int i=1;i<=k;++i)e[i].clear();for(int i=1;i<=n;++i)e[a[i].x].push_back(make_pair(i,1)),e[a[i].y].push_back(make_pair(i,-1));
    /*printf("$%d %d\n",xx,yy);*/for(int i=1;i<=k;++i){/*printf("Ti:%d\n",i);*/for(auto j:e[i])sgt::upd(1,1,q,a[j.first].l,a[j.first].r,j.second);res+=sgt::v[1][3];}/*write(res,'\n');*/for(int i=1;i<=n;++i){if(xx)swap(a[i].y,a[i+n].y);if(yy)swap(a[i].r,a[i+n].r);}return res;}
    void main()
    {
        n=m=read();for(int i=1;i<=n;++i)b[i].x=read(),b[i].y=read(),b[i].l=read(),b[i].r=read(),b[i].id=i,a[i]=b[i];lsh(),cal(1),cal(0);/*output(d,n);for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)if(chk(b[i],b[j]))--d[i],--d[j],printf("#%d %d\n",i,j);for(int i=1;i<=n;++i)assert(!d[i]);*/
        m=2*n;for(int i=1;i<=n;++i)a[i]=a[i+n]=b[i],++a[i].y,--a[i+n].r;lsh();for(int i=0;i<2;++i)for(int j=0;j<2;++j)S+=(i==j?1:-1)*calc(i,j);/*write(S,'\n');for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)if(!chk(b[i],b[j]))for(int k=j+1;k<=n;++k)S-=!chk(b[i],b[k])&&!chk(b[j],b[k]);write(S,'\n'),assert(!S);exit(0);*/
        /*output(d,n);int cnt[5];memset(cnt,0,sizeof(cnt));for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)for(int k=j+1;k<=n;++k)++cnt[1+chk(b[i],b[j])+chk(b[j],b[k])+chk(b[i],b[k])];output(cnt,4);*/
        x=y=0;for(int i=1;i<=n;++i)d[i]=n-1-d[i],y+=d[i],x+=d[i]*(d[i]-1)/2;y/=2,y*=n-2,/*printf("#%lld %lld\n",x,y),*/x-=3*S,y-=2*x+3*S,/*printf("#%lld %lld %lld %lld\n",C(n,3),S,x,y),*/write(C(n,3)-x-y-S,'\n');
    }
};
int main()
{
    const bool base=0,IO=1;int T;if(!base)T=1;else if(IO)T=read();else ios::sync_with_stdio(0),cin>>T;for(;T--;)Main::main();
    return 0;
}