#include<cstdio>

#include<iostream>

#include<string>

#include<cstring>

#include<queue>

#include<vector>

#include<stack>

#include<vector>

#include<map>

#include<set>

#include<algorithm>

//#include<bits/stdc++.h>

using namespace std;

const int maxn = 4e4+;

int g[maxn];

//#define LOCAL

int main()

{

#ifdef LOCAL

    freopen("in.txt","r",stdin);

#endif

    int T; cin>>T;

    while(T--){

        int n, ans = ; scanf("%d",&n);

        for(int i = ,c = ; i < n; i++){

            int x, k; scanf("%d",&x);

            k = lower_bound(g+,g+c,x)-g;

            ans = max(ans,k);

            g[k] = x;

            if(k==c) c++; //不用把辅助数组g初始化，只要维护一个下标即可

        }

        printf("%d\n",ans);

    }

    return ;

}