#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  99999999
#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(i, T){
		int N;
		cin >> N;

		vector<int> arr(N);

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


		vector<int> dpl(N, 1);
		vector<int> dl(N, 0);


		for (int j = 1; j < N; j++){
			int ma = 1;
			int d = 0;
			for (int k = j - 1; 0 <= k; k--){
				if (arr[j] > arr[k] && arr[j] - arr[k] > dl[k]){
					if (ma < dpl[k] + 1){
						ma = dpl[k] + 1;
						d = arr[j] - arr[k];
					}
				}
			}
			dpl[j] = ma;
			dl[j] = d;
		}

		vector<int> dpr(N, 1);
		vector<int> dr(N, 0);

		std::reverse(ALL(arr));

		for (int j = 1; j < N; j++){
			int ma = 1;
			int d = 0;
			for (int k = j - 1; 0 <= k; k--){
				if (arr[j] > arr[k] && arr[j] - arr[k] > dr[k]){
					if (ma < dpr[k] + 1){
						ma = dpr[k] + 1;
						d = arr[j] - arr[k];
					}
				}
			}
			dpr[j] = ma;
			dr[j] = d;
		}

		int ma = -1;

		REP(i, N){
			ma = max(ma, dpl[i] + dpr[i] - 1);
		}

		cout << ma << endl;

	}
	return 0;
}