#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second 
#define pii pair<int,int>
#define mkp make_pair
using namespace std;
const int maxn=2e5+100;
int n,sum=0;
pii p[maxn],Q[maxn];
int G[maxn],a[maxn],h[maxn],z[maxn];
set<int> s;
int cnt[maxn],w[maxn];
ll ans=0;
int main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T;cin>>T;
	while (T--) {
		cin>>n;ans=0;sum=0;
		for (int i=1;i<=n;i++) {
			cin>>p[i].fi>>p[i].se;
			G[2*i-1]=p[i].fi-1;
			G[2*i]=p[i].se;
		}
		if (n==1) {
			cout<<1<<endl;
			continue;
		}
		sort(G+1,G+2*n+1);
		int Gw=unique(G+1,G+2*n+1)-G-1;
		for (int i=2;i<=Gw;i++) a[i]=G[i]-G[i-1];
		for (int i=1;i<=n;i++) {
			p[i].fi=lower_bound(G+1,G+Gw+1,p[i].fi-1)-G+1;
			p[i].se=lower_bound(G+1,G+Gw+1,p[i].se)-G;
			Q[2*i-1]=mkp(p[i].fi,+i);
			Q[2*i]=mkp(p[i].se+1,-i);
		}
		sort(Q+1,Q+2*n+1);
		assert(Q[1].fi==2);
		for (int i=2,j=0;i<=Gw+1;i++) {
			z[i-1]=z[i-2];
			while (j+1<=2*n&&Q[j+1].fi==i) {
				j++;
				if (Q[j].se>0)s.insert(Q[j].se);
				else z[i-1]++,s.erase(-Q[j].se);
			}
			cnt[i]=s.size();
			if (cnt[i]==1) w[i]=*s.begin(),h[w[i]]+=a[i];
			if (cnt[i]!=0) sum+=a[i];
		}
		for (int i=1;i<=n;i++) {
			if (h[i]!=0) {
				int L=z[p[i].fi-1],R=n-z[p[i].se];
				ans+=1ll*h[i]*(sum-1);
				if (p[i].fi==p[i].se) {
					if (L==0||R==0) ans-=1ll*h[i]*(h[i]-1);
					continue;
				}
				if (cnt[p[i].fi]==1&&L==0) ans-=1ll*a[p[i].fi]*(a[p[i].fi]-1);
				if (cnt[p[i].se]==1&&R==0) ans-=1ll*a[p[i].se]*(a[p[i].se]-1);
				if (cnt[p[i].fi]==1&&L==0&&cnt[p[i].se]==1&&R==0) 
					ans-=2ll*a[p[i].fi]*a[p[i].se];
			}
		}
		//cout<<ans<<endl;
		s.clear();
		for (int i=2;i<=Gw;i++) {
		//	cout<<i-1<<" : "<<ans<<endl;
			if (cnt[i]==0) {
				if (n==2) continue;
				int L=z[i],R=n-z[i];
				assert(L!=0&&R!=0);
				if (L>=2&&R>=2) {
					ans+=1ll*a[i]*sum;
					ans+=1ll*a[i]*(G[Gw]-G[1]-1);
				} else {
					if (L==1&&R==2) {
						ans+=2ll*a[i]*(sum-(G[i-1]-G[1]));
					}
					if (L==1&&R>2) {
						ans+=1ll*a[i]*(sum-(G[i-1]-G[1]));
						ans+=1ll*a[i]*(G[Gw]-G[i]);
					}
					if (R==1&&L==2) {
						ans+=2ll*a[i]*(sum-(G[Gw]-G[i]));
					}
					if (R==1&&L>2) {
						ans+=1ll*a[i]*(sum-(G[Gw]-G[i]));
						ans+=1ll*a[i]*(G[i-1]-G[1]);
					}
				}
				continue;
			}
			if (cnt[i]==2) {
				ans+=1ll*a[i]*(sum-1);
				continue;
			}
		}
		for (int i=0;i<=max(n,Gw)+3;i++) {
			h[i]=w[i]=G[i]=z[i]=a[i]=0;
		//	cout<<"["<<G[i-1]+1<<","<<G[i]<<"] "<<cnt[i]<<" "<<w[i]<<endl;
		}
		cout<<ans/2<<endl;
	}
	
}