http://acm.
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int a[200];
int maxa[200];
int main()
{
    int i,nm,n;
    cin>>nm;
    while (nm--)
    {
        cin>>n;
        memset(maxa,0,sizeof(maxa));
        for (i=0;i<n;i++)
            scanf("%d",&a[i]);
        maxa[0]=1;
        for (i=1;i<n;i++)
        {
            int tmp =0;
            for (int j=0;j<i;j++)
            {
                if (a[j]>a[i])
                {
                    if (tmp <a[j])
                    {
                        tmp= maxa[j];
                    }
                }
            }
            maxa[i]=tmp+1;
        }
        int max =0;
        for (i=0;i<n;i++)
            if (maxa[i] >max)
                max= maxa[i];
        printf("%d\n",max);
    }
    return 0;
}