# include <iostream>
# include <string.h>
# include <stdio.h>
# include <algorithm>
using namespace std;
typedef struct Tri
{
int a,b;
}Tri;
int cmp(Tri A,Tri B)
{
if(A.a != B.a)
return A.a < B.a;
else
return A.b < B.b;
}
int main(void)
{
int ncase;
cin >> ncase;
while(ncase--)
{
int n;
cin >> n;
Tri t[n+1];
int dp[n+1];
memset(dp,0,sizeof(dp));
for(int i=0; i<n; ++i)
{
cin >> t[i].a >> t[i].b;
if(t[i].b > t[i].a) swap(t[i].b,t[i].a);
}
int ans = 0;
sort(t,t+n,cmp);
for(int i=0; i<n; ++i)
{
for(int j=0; j<i; ++j)
{
if(t[i].a>t[j].a&&t[i].b>t[j].b)
{
dp[i] = max(dp[i],dp[j]+1);
ans = max(ans,dp[i]);
}
}
}
cout << ans+1<<endl;
}
return 0;
}