#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fr(i, a, b) for (int i = (a); i < (b); i++)
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int N;
const int maxn = 100;
ll A[maxn];
ll dp[maxn][maxn]; // last a[i], last last a[i];
ll xdp[maxn];
ll dp2[maxn][maxn];
ll ydp[maxn];

void solve() {
    rep (i, maxn) rep (j, maxn) dp[i][j] = 0;

    rep (i, N) {
        rep (j, i) {
            if (A[j] < A[i]) dp[i][j] = 1;
            else dp[i][j] = 0;
            rep (k, j) {
                if ((A[j] < A[i] && A[k] < A[j]) && abs(A[k] - A[j]) < abs(A[j] - A[i])) {
                    if (dp[i][j] < dp[j][k] + 1) {
                        dp[i][j] = dp[j][k] + 1;
                    }
                }
            }
        }
    }

    rep (i, N) {
        xdp[i] = 0;
        rep (j, N) {
            xdp[i] = max(xdp[i], dp[i][j]);
        }
    }
}

int main() {
    int T;
    cin >> T;

    rep (k, T) {
        cin >> N;

        rep (i, N) {
            cin >> A[i];
        }

        solve();

        rep (i, N) {
            ydp[i] = xdp[i];
        }

        reverse(A, A + N);

        solve();

        reverse(xdp, xdp + N);

        ll ans = 0;

        rep (i, N) {
            ans = max(ans, xdp[i] + ydp[i] + 1);
        }

        cout << ans << endl;
    }
}