#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

vector<int> f(int N, vector<int>& A) {
	vector<vector<int> > dp(N, vector<int>(N));
	for (int i = 0; i < N; i++)
		for (int j = i + 1; j < N; j++)
			if (A[i] < A[j]) {
				dp[i][j] = max(dp[i][j], 1);
				for (int k = j + 1; k < N; k++)
					if (A[j] - A[i] < A[k] - A[j])
						dp[j][k] = max(dp[j][k], dp[i][j] + 1);
			}
	vector<int> a(N);
	for (int i = 0; i < N; i++)
		for (int j = 0; j < i; j++)
			a[i] = max(a[i], dp[j][i]);
	return a;
}

int main() {
	int T; cin >> T;
	while (T--) {
		int N; cin >> N;
		vector<int> A(N);
		for (int i = 0; i < N; i++)
			cin >> A[i];
		vector<int> a = f(N, A);
		reverse(A.begin(), A.end());
		vector<int> b = f(N, A);
		reverse(b.begin(), b.end());
		int maxi = 0;
		for (int i = 0; i < N; i++)
			maxi = max(maxi, a[i] + b[i]);
		cout << maxi + 1 << endl;
	}
}