#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int T,N;
int A[111];
typedef map<int, map<int, int>> DPType;
DPType DPa, DPb;

void count_dp(int A[], DPType *dp) {
    (*dp)[-1][-1]=0;
    FOR(i,-1,N)FOR(j,i,N)FOR(k,j+1,N){
        if (j>=0 && A[k] <= A[j]) continue;
        if (i>=0) {
            int prev = A[j] - A[i];
            int diff = A[k] - A[j];
            if (diff <= prev) continue;
        }
        (*dp)[j][k] = max((*dp)[j][k], (*dp)[i][j] + 1);
    }
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin>>T;

    while(T--) {
        cin>>N;
        REP(i,N)cin>>A[i];
        DPa.clear();
        count_dp(A, &DPa);
        reverse(A, A+N);
        DPb.clear();
        count_dp(A, &DPb);
        int ans = 0;
        FOR(i,0,N) {
            int a = 0, b = 0;
            FOR(j,-1,i) {
                a = max(a, DPa[j][i]);
            }
            FOR(j,-1,N-i) {
                b = max(b, DPb[j][N-i-1]);
            }
            ans = max(ans, a + b - 1);
        }
        cout << ans << endl;
    }
    
    return 0;
}