#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int t, n, A[100], mm[2], r;
map<int, int> m[2][100];

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> t;
  FOR(i, 0, t){
    cin >> n;
    FOR(j, 0, n) cin >> A[j];
    FOR(j, 0, n){
      m[0][j].clear();
      m[0][j][A[j]] = 1;
      FOR(k, 0, j){
        if(A[k] >= A[j]) continue;
        if(m[0][j].find(A[k]) == m[0][j].end()) m[0][j][A[k]] = 0;
        maxs(m[0][j][A[k]], m[0][k].upper_bound(2*A[k] - A[j])->se + 1);
      }
      r = 0;
      for(map<int, int>::reverse_iterator itr=m[0][j].rbegin(); itr != m[0][j].rend(); itr++){
        maxs(r, itr->se);
        m[0][j][itr->fi] = r;
      }
    }
    FORR(j, n-1, 0){
      m[1][j].clear();
      m[1][j][A[j]] = 1;
      FOR(k, j+1, n){
        if(A[k] >= A[j]) continue;
        if(m[1][j].find(A[k]) == m[1][j].end()) m[1][j][A[k]] = 0;
        maxs(m[1][j][A[k]], m[1][k].upper_bound(2*A[k] - A[j])->se + 1);
      }
      r = 0;
      for(map<int, int>::reverse_iterator itr=m[1][j].rbegin(); itr != m[1][j].rend(); itr++){
        maxs(r, itr->se);
        m[1][j][itr->fi] = r;
      }
    }
    int ans = 0;
    FOR(j, 0, n){
      FOR(k, 0, 2){
        mm[k] = 0;
        each(itr, m[k][j]) maxs(mm[k], itr->se);
      }
      maxs(ans, mm[0] + mm[1] - 1);
    }
    cout << ans << endl;
  }
  return 0;
}