#include <algorithm>
#include <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

vector<int> solve(const vector<int> &a){
  const int n = a.size();
  vector<int> ret(n);

  const int inf = 1000000000 + 10;
  vector<vector<int> > dp(n + 1, vector<int>(n + 1, inf));

  REP(i,n){
    REP(j,n+1) REP(k,n+1) if(dp[j][k] != inf){
      if(dp[j][k] < a[i] - a[j])
        dp[i][k + 1] = min(dp[i][k + 1], a[i] - a[j]);
    }
    dp[i][1] = 0;
    REP(j,n+1) if(dp[i][j] != inf)
      ret[i] = j;
  }

  return ret;
}

int main(){
  const int t = getInt();

  REP(_,t){
    const int n = getInt();
    vector<int> a(n);
    REP(i,n) a[i] = getInt();

    vector<int> dp1 = solve(a);
    reverse(a.begin(), a.end());
    vector<int> dp2 = solve(a);
    reverse(dp2.begin(), dp2.end());

    int ans = 0;
    REP(i,n) ans = max(ans, dp1[i] + dp2[i] - 1);

    printf("%d\n", ans);
  }

  return 0;
}