#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,l[maxn],r[maxn],m;
pii a[maxn];
int lsh[maxn],len;
#define lb(x) (x&(-x))
int tree[maxn];
void upd(int x,int w){
	while(x<=len)tree[x]=max(tree[x],w),x+=lb(x);
}
int que(int x){
	int res=0;
	while(x)res=max(res,tree[x]),x-=lb(x);
	return res;
}
void work(){
	n=read();int ans=0;
	a[m=1]={1,0};
	for(int i=1;i<=n;i++){
		l[i]=(read()-1)*2,r[i]=read()*2;
	}
	for(int i=1;i<n;i++){
		if(r[i+1]>r[i])a[++m]={2*i,r[i]+1};
		if(l[i+1]>l[i])a[++m]={2*i+1,l[i+1]};
	}
	sort(a+1,a+m+1);
	// for(int i=1;i<=m;i++)cout<<a[i].fi<<" "<<a[i].se<<"\n";
	len=0;for(int i=1;i<=m;i++)lsh[++len]=a[i].se;
	sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
	for(int i=1;i<=m;i++)a[i].se=lower_bound(lsh+1,lsh+len+1,a[i].se)-lsh;
	for(int i=1;i<=len;i++)tree[i]=0;
	for(int i=1;i<=m;i++){
		int dp=que(a[i].se-1)+1;
		upd(a[i].se,dp);
		ans=max(ans,dp);
	}
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=read();
	while(T--)work();
}