#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)





int N;
int A[100];
//-----------------------------------------------------------------
map<pair<int, int>, int> memoL;
int dfsL(int cu, int ma) {
	if (memoL.count({ cu,ma })) return memoL[{cu, ma}];

	int ret = 0;
	rep(i, 0, cu) if(A[i] < A[cu]) {
		int d = A[cu] - A[i];
		if (ma <= d) continue;
		ret = max(ret, dfsL(i, d));
	}
	return memoL[{cu, ma}] = (ret + 1);
}
//-----------------------------------------------------------------
map<pair<int, int>, int> memoR;
int dfsR(int cu, int ma) {
	if (memoR.count({ cu,ma })) return memoR[{cu, ma}];

	int ret = 0;
	rep(i, cu + 1, N) if (A[i] < A[cu]) {
		int d = A[cu] - A[i];
		if (ma <= d) continue;
		ret = max(ret, dfsR(i, d));
	}
	return memoR[{cu, ma}] = (ret + 1);
}
//-----------------------------------------------------------------
int cal(int i) { // iを山の中心とした時の最大長を返す
	int l = dfsL(i, INT_MAX);
	int r = dfsR(i, INT_MAX);
	return l + r - 1;
}
int sol() {
	memoL.clear();
	memoR.clear();

	int ans = 1;
	rep(i, 0, N) {
		ans = max(ans, cal(i));
	}
	return ans;
}
//-----------------------------------------------------------------
int main() {
	int T; cin >> T;
	rep(t, 0, T) {
		cin >> N;
		rep(i, 0, N) cin >> A[i];
		cout << sol() << endl;
	}
}