1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdlib>
 4 using namespace std;
 5 typedef struct Node
 6 {
 7     int length,width;
 8 }Node;
 9 Node ch[1005];
10 int f[1005];
11 int cmp(const void *a,const void *b)
12 {
13     Node *c = (Node *)a;
14     Node *d = (Node *)b;
15     if(c->length!=d->length)
16         return d->length - c->length;
17     else
18         return d->width - c->width;
19 }
20 int main()
21 {
22     int i,j,k,t,T;
23     cin>>T;
24     int num,a,b;
25     while(T--)
26     {
27         memset(ch,0,sizeof(ch));
28         cin>>num;
29         if(num==0)
30         {
31             cout<<0<<endl;
32             continue;
33         }
34         for(i=1;i<=num;i++)
35         {
36             cin>>a>>b;
37             if(a<b)
38             {
39                 a^=b;
40                 b^=a;
41                 a^=b;
42             }
43             ch[i].length = a,ch[i].width = b;
44             f[i] = 1;
45         }
46         if(num==1)
47         {
48             cout<<1<<endl;
49             continue;
50         }
51         qsort(&ch[1],num,sizeof(Node),cmp);
52         int max = 0;
53         for(i=2;i<=num;i++)
54         {
55             for(j=i-1;j>=1;j--)
56             if(ch[i].length<ch[j].length&&ch[i].width<ch[j].width)//没有等于
57                 //f[i] >?= f[j] + 1;
58                 if(f[i]<(f[j]+1))
59                     f[i] = f[j] + 1;
60             if(max < f[i])
61                 max = f[i];
62         }
63         cout<<max<<endl;
64     }
65     return 0;
66 }