/*
	Solution By - Amrutansu Garanaik
	Codechef ID - dragonemperor
*/
 
 
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int test,n,s,e;
	scanf("%d",&test);
	while(test--)
	{
		scanf("%d",&n);
		vector <pair<int,int> > input(n);
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&s,&e);
			input[i]=make_pair(e,s);
		}
		sort(input.begin(),input.end());
		int result=1,prev_end=input[0].first;
		for(int i=1;i<n;i++)
		{
			if(input[i].second>prev_end)
			{
				prev_end=input[i].first;
				result++;
			}
		}
		printf("%d\n",result);
	}
	return 0;
}

LyoKCVNvbHV0aW9uIEJ5IC0gQW1ydXRhbnN1IEdhcmFuYWlrCglDb2RlY2hlZiBJRCAtIGRyYWdvbmVtcGVyb3IKKi8KCgojaW5jbHVkZTxzdGRpby5oPgojaW5jbHVkZTxhbGdvcml0aG0+CiNpbmNsdWRlPHZlY3Rvcj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CglpbnQgdGVzdCxuLHMsZTsKCXNjYW5mKCIlZCIsJnRlc3QpOwoJd2hpbGUodGVzdC0tKQoJewoJCXNjYW5mKCIlZCIsJm4pOwoJCXZlY3RvciA8cGFpcjxpbnQsaW50PiA+IGlucHV0KG4pOwoJCWZvcihpbnQgaT0wO2k8bjtpKyspCgkJewoJCQlzY2FuZigiJWQlZCIsJnMsJmUpOwoJCQlpbnB1dFtpXT1tYWtlX3BhaXIoZSxzKTsKCQl9CgkJc29ydChpbnB1dC5iZWdpbigpLGlucHV0LmVuZCgpKTsKCQlpbnQgcmVzdWx0PTEscHJldl9lbmQ9aW5wdXRbMF0uZmlyc3Q7CgkJZm9yKGludCBpPTE7aTxuO2krKykKCQl7CgkJCWlmKGlucHV0W2ldLnNlY29uZD5wcmV2X2VuZCkKCQkJewoJCQkJcHJldl9lbmQ9aW5wdXRbaV0uZmlyc3Q7CgkJCQlyZXN1bHQrKzsKCQkJfQoJCX0KCQlwcmludGYoIiVkXG4iLHJlc3VsdCk7Cgl9CglyZXR1cm4gMDsKfQ==

MgoyCjEgMwozIDUKMgoxIDMKNCA1

2
2
1 3
3 5
2
1 3
4 5