// yukicoder: No.664 超能力者Aと株価予測
// 2019.8.22 bal4u

#include <stdio.h>
#include <string.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in() { // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(int n) { // 正整数の表示（出力）
	int i; char b[30];
	i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
	while (i--) pc(b[i]);
	pc('\n');
}

int df[103][103], dr[103][103];
int a[103];

inline static void chmax(int *ma, int x) { if (*ma < x) *ma = x; }

int main()
{
	int i, j, k, N, T, ans;
	
	T = in(); while (T--) {
		N = in(); for (i = 0; i < N; i++) a[i] = in();
		if (N == 1) { pc('1'), pc('\n'); continue; }
		memset(df, 0, sizeof(df));
		for (i = 0; i < N; i++) df[i][i] = 1;
		for (k = 0; k < N; k++) for (i = 0; i <= k; i++) {
			for (j = i; j <= k; j++) {
				if (a[j] < a[k] && a[j]-a[i] < a[k]-a[j]) chmax(&df[j][k], df[i][j]+1);
			}
		}
		memset(dr, 0, sizeof(dr));
		for (i = N-1; i >= 0; i--) dr[i][i] = 1;
		for (k = N-1; k >= 0; k--) for (i = N-1; i >= k; i--) {
			for (j = i; j >= k; j--) {
				if (a[j] < a[k] && a[j]-a[i] < a[k]-a[j]) chmax(&dr[j][k], dr[i][j]+1);
			}
		}

		ans = 0;
		for (k = 0; k < N; k++) for (i = 0; i <= k; i++) for (j = k; j < N; j++) {
			chmax(&ans, df[i][k]+dr[j][k]);
		}
		out(ans-1);
	}
	return 0;
}