#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
const ll inf = 1e16;
const ll md = 1000000007;

int dp0[100][100],dp1[100][100];

int main() {
  int n,t;
  rep(_,t){
    cin>>n;
    vi a(n);
    rep(i,n) cin>>a[i];
    rep(i,n) rep(j,i){
      if(a[i]<=a[j]) continue;
      dp0[i][j]=1;
      rep(k,j){
        if(a[i]-a[j]<=a[j]-a[k]) continue;
        dp0[i][j]=max(dp0[i][j],dp0[j][k]+1);
      }
    }
    for(int i=n-1;i<=0;i--) for(int j=n-1;j>i;j--){
      if(a[i]<=a[j]) continue;
      dp1[i][j]=1;
      for(int k=n-1;k>j;k--){
        if(a[i]-a[j]<=a[j]-a[k]) continue;
        dp1[i][j]=max(dp1[i][j],dp1[j][k]+1);
      }
    }
    int ans=0;
    rep(i,n){
      int mx0=0,mx1=0;
      rep(j,n) mx0=max(mx0,dp0[i][j]);
      rep(j,n) mx1=max(mx1,dp1[i][j]);
      ans=max(ans,mx0+mx1+1);
    }
    cout<<ans<<endl;
  }
  return 0;
}