int T,n;

int a[1005],f[1005];

bool NOTalone[1005];

int main(){

    //freopen("test.in","r", stdin);

    cin>>T;

    while(T--){

        scanf("%d",&n);

        rep(i,1,n) scanf("%d",&a[i]);

        rep(i,1,n) f[i]=1;

        mem(NOTalone,false);

        rep(i,2,n){

            rep(j,1,i-1) if(a[i]>a[j]){

                if(f[j]+1>f[i]){

                    f[i]=f[j]+1;

                    NOTalone[i] = NOTalone[j];

                }

                else if(f[j]+1==f[i]){

                    NOTalone[i]=true;

                }

            }

        }

        int t=f[1];  rep(i,2,n) t=max(t,f[i]);

        bool NOT_ALONE=false;

        int c=0;

        rep(i,1,n) if(t==f[i]) ++c,NOT_ALONE|=NOTalone[i];

        if(c>1) NOT_ALONE=true;

        if(!NOT_ALONE)

            cout<<t-1<<endl;

        else

            cout<<t<<endl;

    }

    //fclose(stdin);

}