#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
 ll MOD=1000000007;
 ll MOD9=998244353;
 double inf=1e9+10;
 ll INF=1e18;
 ll dy[8]={1,0,-1,0,1,1,-1,-1};
 ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
void solve(){
  ll n;cin >> n;
  vl v(n);rep(i,n)cin >> v[i];
  vvl dp(n,vl(n+1,INF));//i番目の要素が末尾、長さjの最小の差
  rep(i,n)dp[i][1]=0;
  rep(i,n){
    rep(j,n){//dp[i][j]->dp[k][j+1] if(i<k&&dp[i][j]<a[k]-a[i])
      for(int k=i;k<n;k++){
        if(dp[i][j]<v[k]-v[i])chmin(dp[k][j+1],v[k]-v[i]);
      }
    }
  }
  vvl ndp(n,vl(n+1,INF));
  rep(i,n)ndp[i][1]=0;
  rev(all(v));
  rep(i,n){
    rep(j,n){//dp[i][j]->dp[k][j+1] if(i<k&&dp[i][j]<a[k]-a[i])
      for(int k=i;k<n;k++){
        if(ndp[i][j]<v[k]-v[i])chmin(ndp[k][j+1],v[k]-v[i]);
      }
    }
  }
  rev(all(ndp));
  ll ans=0;
  rep(i,n){
    ll left=0,right=0;
    rep(j,n+1)if(dp[i][j]<INF)chmax(left,j);
    rep(j,n+1)if(ndp[i][j]<INF)chmax(right,j);
    chmax(ans,left+right-1);
  }
  cout << ans <<endl;
  /*rep(i,n){
    rep(j,n+1){
      cout << dp[i][j] <<" ";
    }
    cout << endl;
  }*/
}
int main(){
  ll t;cin >> t;
  while(t--)solve();
}