#include <bits/stdc++.h>

using namespace std;

vector<int> calc(const vector<int> &a) {
  int n = a.size();
  vector<int> ret(n);
  vector<vector<int> > dp(n, vector<int>(n));
  
  for (int i = 0; i < n; i++) {
    dp[i][i] = 1;
    for (int j = 0; j <= i; j++) {
      for (int k = i + 1; k < n; k++) {
        if (a[k] > a[i] + (a[i] - a[j]))
          dp[k][i] = max(dp[k][i], dp[i][j] + 1);
      }
      ret[i] = max(ret[i], dp[i][j]);
    }
  }
  
  return ret;
}

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++)
    cin >> a[i];

  vector<int> pref = calc(a);
  reverse(a.begin(), a.end());
  vector<int> suff = calc(a);

  int ret = 0;
  for (int i = 0; i < n; i++) {
    ret = max(ret, pref[i] + suff[n-1-i] - 1);
  }

  cout << ret << endl;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int t;
  cin >> t;
  while (t--)
    solve();
  
  return 0;
}