#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <memory>
#include <functional>
 
using namespace std;

int LL[111][111];
int RR[111][111];

int dfsLL(vector<int> &v, int i, int j) {
    if (LL[i][j] >= 0) return LL[i][j];

    int ans = 0;
    for (int k = 0; k < i; k++) {
        if (v[k] < v[i] && v[i] - v[k] < v[j] - v[i]) ans = max(ans, dfsLL(v, k, i) + 1);
    }
    return LL[i][j] = ans;
}

int dfsRR(vector<int> &v, int i, int j) {
    if (RR[i][j] >= 0) return RR[i][j];

    int ans = 0;
    for (int k = j + 1; k < v.size(); k++) {
        if (v[k] < v[j] && abs(v[j] - v[k]) < abs(v[j] - v[i])) ans = max(ans, dfsRR(v, j, k) + 1);
    }
    return RR[i][j] = ans;
}

int main(int argc, char const *argv[]) {
    int T;
    cin >> T;
    for (int t = 0; t < T; t++) {
        int N;
        cin >> N;
        vector<int> v;
        for (int i = 0; i < N; i++) {
            int temp;
            cin >> temp;
            v.push_back(temp);
        }
        for (int i = 0; i < 111; i++) {
            for (int j = 0; j < 111; j++) {
                LL[i][j] = -1;
                RR[i][j] = -1;
            }
        }
        int ans = -1;
        for (int center = 0; center < N; center++) {
            int lma = 0, rma = 0;
            for (int i = 0; i < center; i++) {
                if (v[i] < v[center]) lma = max(lma, dfsLL(v, i, center) + 1);
            }
            for (int i = center + 1; i < N; i++) {
                if (v[i] < v[center]) rma = max(rma, dfsRR(v, center, i) + 1);
            }
            //cout << "debug : " << center << " : " << lma << " " << rma << endl;
            ans = max(ans, lma + rma + 1);
        }
        cout << ans << endl;

    }
    return 0;
}