#include <iostream>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
//LIS
const int MAX_LENGTH = 500;
int arr_max[MAX_LENGTH];
int result[MAX_LENGTH];

int binarySearch(int first, int last, int value)
{
    if (first > last)
        return 0;

    int mid = (first + last) / 2;

    if (arr_max[mid-1] < value && arr_max[mid] > value)
        return mid;

    else if (arr_max[mid - 1] > value)
        return binarySearch(0, mid, value);

    else 
        return binarySearch(mid + 1, last, value);
}

int calculate_maxSize(int arr[], int length)
{
    int index = 0;
    int size = 0;
    arr_max[index] = arr[0];
    for (int i = 1; i < length; i++)
    {
        if (arr_max[index] < arr[i])
            arr_max[++index] = arr[i];

        else
        {
            int temp = binarySearch(0, index, arr[i]);
            arr_max[temp] = arr[i];
        }
    }

    while (arr_max[size] != 0)
        size++;

    return size;
}

int main()
{
    int caseNum;
    int arrSize = 0;
    int arr[MAX_LENGTH];

    cin >> caseNum;
    for (int i = 0; i < caseNum; i++)
    {
        memset(arr_max, 0, sizeof(int)*arrSize);
        cin >> arrSize;

        for (int j = 0; j < arrSize; j++)
            cin >> arr[j];

        cout << calculate_maxSize(arr, arrSize) << endl;
    }
    return 0;
}
}