#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>

using namespace std;

int t, n, a;

int cache[101], S[100];

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;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> t;
    for (int i = 0; i < t; i++) {
        cin >> n;

        memset(S, -1, sizeof(S));
        memset(cache, -1, sizeof(cache));

        for (int j = 0; j < n; j++) {
            cin >> S[j];

        }

        cout << lis3(-1)-1<<endl;
    }
}