#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;
#define M 110
ll T, N, A[M], dp[M][M], dp2[M][M];

ll solve(int p){
	memset(dp, -1, sizeof(dp));
	memset(dp2, -1, sizeof(dp2));
	dp[N][p] = dp2[N][p] = 0;
	for(int i = p+1; i < N; i++){
		for(int j = 0; j <= N; j++){
			for(int k = 0; k < N; k++){
				if(dp2[j][k]>=0 && A[j]-A[k]>A[k]-A[i] && A[k]-A[i]>0) dp2[k][i] = max(dp2[k][i], dp2[j][k]+1);
			}
		}
	}
	for(int i = p-1; i >= 0; i--){
		for(int j = 0; j <= N; j++){
			for(int k = 0; k < N; k++){
				if(dp[j][k]>=0 && A[j]-A[k]>A[k]-A[i] && A[k]-A[i]>0) dp[k][i] = max(dp[k][i], dp[j][k]+1);
			}
		}
	}
	ll r = 0, r2 = 0;
	for(int i = 0; i < N; i++){
		for(int j = 0; j < N; j++){
			r = max(r, dp[i][j]);
			r2 = max(r2, dp2[i][j]);
		}
	}
	return r+r2+1;
}

int main(){
	cin>>T;
	while(T--){
		cin>>N;
		for(int i = 0; i < N; i++) cin>>A[i];
		A[N] = 1e10;
		ll res = 1;
		for(int i = 0; i < N; i++)
			res = max(res, solve(i));
		cout<<res<<endl;
	}
	return 0;
}