#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
const int N=1e5+5,oo=1e9,mod=1e9+7;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}

int n,c[N<<1],L[N],R[N],t[N<<1],val[N<<1];
int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif
    int TT=read();
    while(TT--) {
        n=read(); c[0]=0;
        for(int i=1;i<=n;++i) {
            L[i]=read(),R[i]=read();
            c[++c[0]]=L[i];c[++c[0]]=R[i]+1;
        }
        sort(c+1,c+c[0]+1); c[0]=unique(c+1,c+c[0]+1)-c-1;
        if(n==1) {
            printf("1\n");
            continue;
        }
        if(c[0]==2) {
            printf("%lld\n",1ll*(c[2]-c[1])*(c[2]-c[1]-1)/2);
            continue;
        }
        int qwq=0,qaq=0,ovo=c[0]+1,fl=0;
        for(int i=1;i<=n;++i) {
            L[i]=lower_bound(c+1,c+c[0]+1,L[i])-c,
            R[i]=lower_bound(c+1,c+c[0]+1,R[i]+1)-c;
            if(R[i]==c[0]) qwq=i;
            else qaq=mx(qaq,R[i]);
            if(L[i]!=1) ovo=mn(ovo,L[i]);
            if(L[i]==1&&R[i]==c[0]) fl=1;
            ++t[L[i]];--t[R[i]];
            val[L[i]]^=i;val[R[i]]^=i;
        }
        for(int i=1;i<=c[0];++i)
            t[i]+=t[i-1],val[i]^=val[i-1];
        ll ans=0;
        for(int i=2;i<=c[0]-2;++i) {
            if(!t[i]) continue;
            if(t[i]==1&&val[i]==qwq) ans+=1ll*(c[i+1]-c[i])*(c[qaq]-c[i]+c[qaq]-c[i+1]+1)/2;
            else ans+=1ll*(c[i+1]-c[i])*(c[c[0]]-c[i]+c[c[0]]-c[i+1]+1)/2;
        }
        if(t[1]>1) ans+=1ll*(c[2]-c[1])*(c[c[0]]-c[1]-1+c[c[0]]-c[2])/2;
        else {
            if(fl&&t[c[0]-1]==1) ans+=1ll*(c[qaq]-c[ovo])*(c[2]-c[1]);
            else ans+=1ll*(c[qwq]-c[ovo])*(c[2]-c[1]);
        }
        if(t[c[0]-1]>1) ans+=1ll*(c[c[0]]-c[c[0]-1])*(c[c[0]]-c[c[0]-1]-1)/2; 
        printf("%lld\n",ans);
        for(int i=1;i<=c[0];++i) t[i]=val[i]=0;
    }
    return 0;
}