#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <stack>
#include <array>
#include <fstream>


#define REP(i,n) for(int (i) = 0;(i) < (n) ; ++(i))
#define REPA(a,i,n) for(int (i) = (a) ; (i) < (n) ; ++(i))
#if defined(_MSC_VER)||__cplusplus > 199711L
#define AUTO(r,v) auto r = (v)
#else
#define AUTO(r,v) typeof(v) r = (v)
#endif
#define ALL(c) (c).begin() , (c).end()
#define EACH(it,c) for(AUTO(it,(c).begin());it != (c).end();++it)
#define LL long long
#define int LL
#define INF  999999999999
#define DEV 1000000007
#define QUICK_CIN ios::sync_with_stdio(false); cin.tie(0);
using namespace std;



signed main()
{
	QUICK_CIN;
	//ifstream cin("debug.txt");
	//ofstream cout("result.txt");


	int T;

	cin >> T;

	REP(times, T){
		int N;
		cin >> N;

		vector<int> arr(N);

		int dpl[110][110];
		int dpr[110][110];

		fill(&dpl[0][0], &dpl[0][0] + 110 * 110, INF);
		fill(&dpr[0][0], &dpr[0][0] + 110 * 110, INF);

		REP(i, N){
			cin >> arr[i];
		}

		REP(i, N){
			dpl[i][0] = 0;
			dpr[i][0] = 0;
		}
		
		REP(i, N){
			for (int j = i-1; 0 <= j; j--){
				REP(k, N-1){
					if (arr[i] > arr[j] && dpl[j][k] < arr[i] - arr[j]){
						dpl[i][k + 1] = min(dpl[i][k + 1], arr[i] - arr[j]);
					}
				}
			}
		}


		std::reverse(ALL(arr));

		REP(i, N){
			for (int j = i - 1; 0 <= j; j--){
				REP(k, N - 1){
					if (arr[i] > arr[j] && dpr[j][k] < arr[i] - arr[j]){
						dpr[i][k + 1] = min(dpr[i][k + 1], arr[i] - arr[j]);
					}
				}
			}
		}

		int ma = -1;

		REP(i, N){
			int ll = -1;
			int rr = -1;
			REP(j, N){
				if (dpl[i][j] != INF){
					ll = max(ll, j);
				}

				if (dpr[N-i-1][j] != INF){
					rr = max(rr, j);
				}
			}

			ma = max(ll + rr + 1, ma);
		}

		cout << ma << endl;

	}
	return 0;
}