#include "bits/stdc++.h"
using namespace std;
const int Len = 1e5 + 5;
int n,m;
struct Segmt
{
	int l,r;
	Segmt(){l = r = 0;}
	Segmt(int L,int R){l = L , r = R;}
}seg[Len];
bool cmp(Segmt x,Segmt y){return x.l < y.l || (x.l == y.l && x.r < y.r);} 
signed main()
{
	int T;scanf("%d",&T);
	while(T --)
	{
		priority_queue<int,vector<int>,greater<int>> Q;
		scanf("%d",&n);
		for(int i = 1 ; i <= n ; i ++) scanf("%d %d",&seg[i].l,&seg[i].r);
		sort(seg + 1 , seg + 1 + n , cmp);
		int now = 0 , as = 0 , i = 1;
		while(1)
		{
			while(i <= n && seg[i].l <= now + 1)
			{
				Q.push(seg[i].r);
				i ++;
			}
			while(!Q.empty() && Q.top() <= now) Q.pop();
			if(!Q.empty())
			{
				now ++;
				Q.pop();
				as ++;
			}
			else
			{
				if(i <= n)
				{
					now = seg[i].l;
					as ++;
					i ++;
				}
			}
			if(i >= n + 1 && Q.empty()) break;
		}
		printf("%d\n",as);
	}
	return 0;
}