#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 111;
int A[MAXN];
int dp[MAXN][MAXN];
int dp2[MAXN][MAXN];

int solve(int n) {
    memset(dp, -1, sizeof(dp));
    for (int i = 0; i < n; i++) dp[i][i] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            for (int k = i+1; k < n; k++) {
                if (A[k]-A[i] > 0 && A[k]-A[i] > A[i]-A[j]) {
                    dp[k][i] = max(dp[k][i], dp[i][j] + 1);
                }
            }
        }
    }
    memset(dp2, -1, sizeof(dp2));
    for (int i = 0; i < n; i++) dp2[i][i] = 1;
    for (int i = n-1; i >= 0; i--) {
        for (int j = n-1; j >= i; j--) {
            for (int k = i-1; k >= 0; k--) {
                if (A[k]-A[i] > 0 && abs(A[k]-A[i]) > abs(A[i]-A[j])) {
                    dp2[k][i] = max(dp2[k][i], dp2[i][j] + 1);
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            for (int k = i; k < n; k++) {
                ans = max(ans, dp[i][j] + dp2[i][k]);
            }
        }
    }
    return ans;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        for (int i = 0; i < N; i++) {
            cin >> A[i];
        }
        cout << solve(N)-1 << endl;
    }
    return 0;
}