#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int N;
vi A;
// prepre,pre
int dp[100][100], up[100], down[100];

void solve(){
    MEM(dp, -1);
    MEM(up, 0);

    rep(pre, N)rep(prepre, pre){
        if(A[prepre] < A[pre])up[pre] = dp[prepre][pre] = 1;
    }
    rep(i, N){
        rep(pre, i)rep(prepre, pre)if(dp[prepre][pre]!=-1 && A[pre]<A[i]){
            int predif = A[pre] - A[prepre];
            int dif = A[i] - A[pre];
            if(dif > predif){
                smax(dp[pre][i], dp[prepre][pre] + 1);
                smax(up[i], dp[pre][i]);
            }
        }
    }

    /////////////

    MEM(dp, -1);
    MEM(down, 0);

    rep(pre, N)FOR(prepre, pre + 1, N)if(A[prepre] < A[pre])down[pre] = dp[prepre][pre] = 1;

    for(int i = N - 1; i >= 0; --i){
        FOR(pre, i + 1, N)FOR(prepre, pre + 1, N)if(dp[prepre][pre]!=-1 && A[pre]<A[i]){
            int predif = A[pre] - A[prepre];
            int dif = A[i] - A[pre];
            if(dif > predif){
                smax(dp[pre][i], dp[prepre][pre] + 1);
                smax(down[i], dp[pre][i]);
            }
        }
    }

    int ans = 0;
    rep(i, N)smax(ans, up[i] + down[i] + 1);
    cout << ans << endl;
}

int main(){
    int T;
    cin >> T;
    while(T--){
        cin >> N;
        A.resize(N);
        rep(i, N)scanf("%d", &A[i]);
        solve();
    }
}