#include <bits/stdc++.h>
using namespace std;

vector<int> A;
vector<vector<int>> memo;

int dp(int now, int bef) {
    if (now < bef)
        return 0;
    if (now == bef)
        return 1;
    if (A[bef] >= A[now])
        return 0;
    int& ret = memo[now][bef];
    if (ret)
        return ret;
    ret = 1;
    for (int i = 0; i <= bef; i++) {
        if (A[now] - A[bef] > A[bef] - A[i])
            ret = max(ret, dp(bef, i) + 1);
    }
    return ret;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        A.resize(N);
        memo.resize(N);
        for (int i = 0; i < N; i++) {
            cin >> A[i];
            memo[i].resize(N);
            fill(memo[i].begin(), memo[i].end(), 0);
        }
        vector<int> memo1(N);
        for (int i = 0; i < N; i++) {
            for (int j = 0; j <= i; j++) {
                memo1[i] = max(memo1[i], dp(i, j));
            }
        }

        reverse(A.begin(), A.end());
        for (int i = 0; i < N; i++) {
            fill(memo[i].begin(), memo[i].end(), 0);
        }
        vector<int> memo2(N);
        for (int i = 0; i < N; i++) {
            for (int j = 0; j <= i; j++) {
                memo2[i] = max(memo2[i], dp(i, j));
            }
        }

        int ans = 0;
        for (int i = 0; i < N; i++) {
            ans = max(ans, memo1[i] + memo2[N - i - 1] - 1);
        }
        cout << ans << endl;
    }
}