#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int T;
	cin>>T;
	while(T--)
	{
		int n;
		cin>>n;
		vector<tuple<int,int,int>> a,b;
		for(int i=1;i<=n;i++)
		{
			int l,r;
			cin>>l>>r;
			a.emplace_back(l,r,i);
		}
		if(n==1)
		{
			cout<<1<<endl;
			continue;
		}
		const int MAGIC=4;
		sort(a.begin(),a.end(),[&](const auto &x,const auto &y){return get<0>(x)<get<0>(y);});
		for(int i=0;i<min(MAGIC,n);i++)b.push_back(a[i]);
		sort(a.begin(),a.end(),[&](const auto &x,const auto &y){return get<1>(x)<get<1>(y);});
		for(int i=0;i<min(MAGIC,n);i++)b.push_back(a[i]);
		sort(b.begin(),b.end());
		b.resize(unique(b.begin(),b.end())-b.begin());
		vector<int> events;
		for(int i=0;i<(int)b.size();i++)
		{
			events.push_back(get<0>(b[i]));
			events.push_back(get<1>(b[i])+1);
			get<2>(b[i])=i;
		}
		int szb=b.size();
		auto check=[&](int x,int y)
		{
			for(int a1=0;a1<szb;a1++)
			{
				if(get<0>(b[a1])<=x and x<=get<1>(b[a1]))
				{
					for(int b1=0;b1<szb;b1++)
					{
						if(a1!=b1 and get<0>(b[b1])<=y and y<=get<1>(b[b1]))
							return true;
						if(a1!=b1 and get<0>(b[b1])<=y)
						{
							for(int b2=0;b2<szb;b2++)
							{
								if(a1!=b2 and y<=get<1>(b[b2]))
									return true;
							}
						}
					}
				}
				if(get<0>(b[a1])<=x)
				{
					for(int a2=0;a2<szb;a2++)
					{
						if(a1!=a2 and x<=get<1>(b[a2]))
						{
							for(int b1=0;b1<szb;b1++)
							{
								if(a1!=b1 and a2!=b1 and get<0>(b[b1])<=y and y<=get<1>(b[b1]))
									return true;
								if(a1!=b1 and a2!=b1 and get<0>(b[b1])<=y)
								{
									for(int b2=0;b2<szb;b2++)
									{
										if(a1!=b2 and a2!=b2 and y<=get<1>(b[b2]))
											return true;
									}
								}
							}
						}
					}
				}
			}
			return false;
		};
		sort(events.begin(),events.end());
		events.resize(unique(events.begin(),events.end())-events.begin());
		int sz=events.size();
		long long ans=0;
		for(int i=0;i+1<sz;i++)
		{
			int li=events[i],ri=events[i+1]-1;
			for(int j=i;j+1<sz;j++)
			{
				int lj=events[j],rj=events[j+1]-1;
				if(check(li,lj))
				{
					if(i==j)
						ans+=1ll*(ri-li+1)*(ri-li)/2;
					else
						ans+=1ll*(ri-li+1)*(rj-lj+1);
				}
			}
		}
		cout<<ans<<"\n";
	}
	
	return 0;
}