#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000
	
vector<int> get(vector<int> a){
	int n = a.size();
	vector<int> ret(n,0);
	vector dp(n,vector<long long>(n+1,Inf));
	rep(i,n){
		dp[i][1] = 0;
		rep(j,n+1){
			if(j==0)continue;
			rep(k,i){
				if(dp[k][j-1] < a[i] - a[k]){
					dp[i][j] = min(dp[i][j],(long long)a[i]-a[k]);
				}
			}
			
		}
	}
	rep(i,n){
		rep(j,n+1){
			if(dp[i][j]==Inf)continue;
			ret[i] = j;
		}
	}
	return ret;
}

int main(){	
	
	int _t;
	cin>>_t;
	
	rep(_,_t){
		int N;
		cin>>N;
		
		vector<int> A(N);
		rep(i,N)cin>>A[i];
		
		auto a = get(A);
		reverse(A.begin(),A.end());
		auto b = get(A);
		reverse(b.begin(),b.end());
		int ans = 0;
		rep(i,N)ans = max(ans,a[i]+b[i]-1);
		cout<<ans<<endl;
	}

	return 0;
	
}