#include <iostream>
#include <algorithm>
#include <queue>
#include <cstdio>
using namespace std;
class Time{
public:
int B;
int E;
};
bool cmp(Time a,Time b){
return a.E<b.E;
}
int main(){
Time time[10001];
int i,n,m,temp=0,q=1;
cin>>m;
while(m--){
cin>>n;
for(i=0;i<n;i++){
scanf("%d %d",&time[i].B,&time[i].E);//cin>>time[i].B>>time[i].E>>endl;
}
sort(time,time+n,cmp);
for(i=1;i<n;i++){
if(time[i].B>time[temp].E){
temp=i;
q++;
}
}
cout<<q<<endl;
}
return 1;
}