#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 105, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;

int n, a[MX];
int dp[MX][MX];
int d[2][MX];

inline bool f(int i, int j, int k) {
  if (a[i] <= a[j]) return false;
  if (a[j] <= a[k]) return false;
  if (a[i]-a[j] <= a[j]-a[k]) return false;
  return true;
}

int main(){
  int ts;
  scanf("%d",&ts);
  rep(ti,ts) {
    scanf("%d",&n);
    rep(i,n) scanf("%d",&a[i]);
    rep(l,2) {
      rep(i,n)rep(j,n+1) dp[i][j] = 0;
      rep(i,n)rep(j,i){
        rep(k,j) {
          if (f(i,j,k)) maxs(dp[i][j],dp[j][k]+1);
        }
        if (a[i] > a[j]) maxs(dp[i][j],dp[j][n]+1);
      }
      rep(i,n) d[l][i] = 0;
      rep(i,n)rep(j,n+1) maxs(d[l][i],dp[i][j]);
      reverse(a,a+n);
    }
    int ans = 0;
    rep(i,n) maxs(ans,d[0][i]+d[1][n-1-i]+1);
    cout<<ans<<endl;
  }
  return 0;
}