#include <iostream>
#include <vector>

using namespace std;

int n;
int cache[500], S[500];

int lis3(int);

int main()
{
    int times = 0;
    cin >> times;
    vector<int> answer;

    for(int i = 0; i < times; ++i)
    {
        cin >> n;
        for(int j = 0; j < n; ++j)
            cin >> S[j];
        for(int j = 0; j < 500; ++j) cache[j] = -1;
        answer.push_back(lis3(-1)-1);
    }

    for(int i = 0; i <times; ++i) cout << answer[i] << endl;
    return 0;
}

int lis3(int start)
{
    int& ret = cache[start+1];
    if(ret != -1) return ret;
    ret = 1;
    for(int next = start + 1; next < n; ++next)
        if(start == -1 || S[start] < S[next])
            ret = max(ret, lis3(next) +1);
    return ret;
}