#include<bits/stdc++.h>
using namespace std;
int l[1001];
int memo[1002][1002];
int N;
 
 
int lis(int n, int p)
{
    if(memo[n][p] != -1)  return memo[n][p];
 
    if(n==N)              return 0;
 
    if(l[p] >= l[n])      return memo[n][p] = lis(n+1, n)+1;
 
    return memo[n][p] = max(lis(n+1, n)+1, lis(n+1,p) );
}
 
 
 
int main()
{
		int T;
		scanf("%d",&T);
		while(T--)
		{
			scanf("%d",&N);
			memset(memo,-1,sizeof(memo));
			for(int i=0; i <N; i++)
			{
					scanf("%d",&l[i]);
			}
			printf("%d\n",lis(0, N));
		}
        return 0;
}
 

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IGxbMTAwMV07CmludCBtZW1vWzEwMDJdWzEwMDJdOwppbnQgTjsKCgppbnQgbGlzKGludCBuLCBpbnQgcCkKewogICAgaWYobWVtb1tuXVtwXSAhPSAtMSkgIHJldHVybiBtZW1vW25dW3BdOwoKICAgIGlmKG49PU4pICAgICAgICAgICAgICByZXR1cm4gMDsKCiAgICBpZihsW3BdID49IGxbbl0pICAgICAgcmV0dXJuIG1lbW9bbl1bcF0gPSBsaXMobisxLCBuKSsxOwoKICAgIHJldHVybiBtZW1vW25dW3BdID0gbWF4KGxpcyhuKzEsIG4pKzEsIGxpcyhuKzEscCkgKTsKfQoKCgppbnQgbWFpbigpCnsKCQlpbnQgVDsKCQlzY2FuZigiJWQiLCZUKTsKCQl3aGlsZShULS0pCgkJewoJCQlzY2FuZigiJWQiLCZOKTsKCQkJbWVtc2V0KG1lbW8sLTEsc2l6ZW9mKG1lbW8pKTsKCQkJZm9yKGludCBpPTA7IGkgPE47IGkrKykKCQkJewoJCQkJCXNjYW5mKCIlZCIsJmxbaV0pOwoJCQl9CgkJCXByaW50ZigiJWRcbiIsbGlzKDAsIE4pKTsKCQl9CiAgICAgICAgcmV0dXJuIDA7Cn0K

MQoxNgowIDggNCAxMiAyIDEwIDYgMTQgMSA5IDUgMTMgMyAxMSA3IDE1

1
16
0 8 4 12 2 10 6 14 1 9 5 13 3 11 7 15