#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>

using namespace std;

inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 1e9;

ll b[101];
int v[101];
int n;
int dfs(int i,int l){

	if (i == n){
		return l;
	}

	v[l] = b[i];

	int ret = l;
	For(j, i + 1, n){

		int t = 0;
		rep(k, l){
			if (v[k] > v[k + 1])t++;
		}

		if (!t && b[j]-b[i] > v[l]-v[l-1]){
 			ret = max(ret,dfs(j, l + 1));
		}
		else
		if (t || b[j]-b[i] < v[l]-v[l-1]){
			if (b[j] == v[l-2*t-1])
			ret = max(ret, dfs(j, l + 1));
		}
	}
	return ret;
}

int main()
{
	int t;
	cin >> t;

	rep(_, t){
		cin >> n;
		rep(i, n)cin >> b[i];

		int ans = 0;
		rep(i, n){
			v[0] = b[i];
			ans = max(ans,dfs(i,1));
		}

		cout << ans << endl;
	}

	return 0;
}