import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
long[] A;

void main() {
  foreach (tc; 0 .. readInt()) {
    N = readInt();
    A = new long[N];
    foreach (i; 0 .. N) {
      A[i] = readLong();
    }
    
    auto dp = new int[][][](2, N, N);
    foreach (h; 0 .. 2) {
      foreach (i; 0 .. N) foreach (j; 0 .. i) {
        if (A[i] > A[j]) {
          dp[h][i][j] = 1;
          foreach (k; 0 .. j) {
            if (A[i] - A[j] > A[j] - A[k]) {
              chmax(dp[h][i][j], 1 + dp[h][j][k]);
            }
          }
        }
      }
      A.reverse;
    }
    int ans;
    foreach (i; 0 .. N) {
      chmax(ans, 1 + dp[0][i][0 .. i + 1].maxElement + dp[1][N - 1 - i][0 .. N - 1 - i + 1].maxElement);
    }
    writeln(ans);
  }
}