#include <cstring>
#include <string.h>
#include <map>
#include <deque>
#include <queue>
#include <stack>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <vector>
#include <set>
#include <complex>
#include <list>
#include <unistd.h>

using namespace std;
#define MAX 501
int N;
int cache[MAX];
int array[MAX];


int readIntsToArray(string &s, int* array) {

    stringstream ss(s);
    int temp;
    int n = 0;

    while(ss>>temp) {
        array[n++] = temp;
    }

    return n;
}

int getMax(int start, int n) {

    if (cache[start] != -1) {
        return cache[start];
    }

    int ret = 1;
    for (int next = start +1 ; next < n; next++) {
        if (array[start] < array[next]) {
            ret += getMax(next, n);
            cache[start] = ret;
            break;
        }
    }

    return ret;
}

int solve(int n, int *array) {
    int maxLen = -1;

    for(int i = 0 ; i<n; i++){
        maxLen = max(getMax(i, n), maxLen);
    }

    return maxLen;
}

int main() {

    int el_len;
    string s;
    cin>>N;
    while(N--) {

        vector<int> v1;

        cin>>el_len;
        getline(cin,s);             // after cin, null line comes...
        getline(cin,s);

        // clear memory
        memset(cache, -1, sizeof(cache));
        memset(array, -1, sizeof(array));

        int n = readIntsToArray(s, array);


        cout<<solve(n, array)<<endl;
    }
    return 0;
}