#include <iostream>

#define MAXN 500005

using namespace std;

int T[MAXN];

int binary_search(int *  a, int size, int num) ;

int main()

{

    //freopen("acm.acm","r",stdin);

    int i;

    int index;

    int test;

    int num;

    int place;

    int x;

    cin>>test;

    while(test --)

    {

        index = ;

        cin>>num;

        cin>>x;

        T[] = x;

        for(i = ; i < num; ++ i)

        {

            cin>>x;

            if(x <=    T[])

            {

                T[] = x;

            }

            else if(x > T[index-])

            {

                T[index ++] = x;

            }

            else

            {

                place = binary_search(T,index,x);

                T[place] = x;

            }

        }

        cout<<index<<endl;

    }

}

int binary_search(int *  a, int size, int num)

{

    int l = ;

    int r = size-;

    while(l <= r)

    {

        int mid = (l + r) / ;

        if(num > a[mid-] && num <= a[mid] )

            return mid;

        else if(num < a[mid])

            r = mid-;

        else

            l = mid+;

    }

}