#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mxn=1e5+5;
pair<int,int> a[mxn];
/*
100
5
1 2
3 4
5 6
6 7
4 4
*/
int main()
{
	int T=read();
	while(T--)
	{
		int n=read(),i,j,mx=-1,ans=n;
		for(i=1;i<=n;i++)
			a[i].first=read(),a[i].second=read();
		sort(a+1,a+1+n);
		for(i=1;i<=n;i++)
		{
			if(a[i].first<=mx)
			{
				ans=0;
				for(j=1;j<i;j++)
					ans+=a[j].second<a[i].first;
				break;
			}
			mx=max(mx,a[i].second);
		}
		printf("%d\n",ans);
	}
}