Nested Dolls

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (20000)
ii o[MX];
int a,b;
multiset<int> T;
int main(void){
    IN(_)F(_){
        IN(N)F(N)scanf("%d%d",&a,&b),o[i]={-a,b};
        sort(o,o+N),T.clear();
        F(N){
            auto I=T.upper_bound(o[i].bb);
            if(I!=T.end())T.erase(I);
            T.insert(o[i].bb);
        }
        printf("%lu\n",T.size());
    }
    return 0;
}