#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    int N, T, ans;
    cin >> T;
    while (T){
        cin >> N;
        ans = -1e9;
        vector<int> A(N);
        for (int i=0; i<N; i++) cin >> A[i];

        vector<vector<int>> L(N, vector<int>(N, -1e9)), R(N, vector<int>(N, -1e9));
        for (int i=0; i<N; i++){
            L[i][i] = 1;
            R[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[i]<A[k] && A[i]-A[j] < A[k]-A[i]){
                        L[k][i] = max(L[k][i], L[i][j]+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] && abs(A[k]-A[i]) > abs(A[i]-A[j])){
                        R[k][i] = max(R[k][i], R[i][j]+1);
                    }   
                }   
            }   
        }

        for (int i=0; i<N; i++){
            for (int j=0; j<=i; j++){
                for (int k=i; k<N; k++){
                    ans = max(ans, L[i][j]+R[i][k]);
                }
            }
        }

        cout << ans-1 << endl;
        T--;
    }

    return 0;
}