#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned ll
#define RV  return void
#define inf 2000000000
//#define MOD ((ll) 1e9 + 7)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Mini(x) *min_element(all(x))
#define Maxi(x) *max_element(all(x))
#define fixed(n) fixed << setprecision(n)
//#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define clr(memo, x) memset(memo, x, sizeof memo)
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define vi vector < int >
#define vl vector < ll >
#define vc vector < char >
#define vs vector < string >
#define v2i vector < vector < int > >
#define v2l vector < vector < int > >
#define seti set < int >
#define setl set < ll >
#define mapii map < int , int >
#define mapll map < ll , ll >
#define mapli map < ll , int >
#define mapci map < char , int >
#define mapsi map < string , int >
#define pll pair < ll , ll >
#define pii pair < int , int >
#define range(l,r,x) for(int i=l ; i < r ; i+=x)
#define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
vector < string > ternary= {"NO\n" , "YES\n"};

void  Zainab(){
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);
              freopen("output.txt", "w", stdout);
            #endif
}


/*================================  Prblem solution  ================================ */



int n ;

vector < ll > v , dp ;
deque < ll > dq ;

ll rec(int idx  ){
    if( idx >= n or !is_sorted(all(dq)) ) return 0;

    ll& ret = dp[idx];
    if(~ret) return ret;
    ret = max(ret , rec(idx+1));

    dq.push_back( v[idx] );
    ret = max(ret ,1+ rec(idx+1) );
    dq.pop_back() ;

    dq.push_front( v[idx] );
    ret = max(ret ,1+ rec(idx+1) );
    dq.pop_front();

    return ret ;
}



void myCode(int test){

cin >> n ;

v.assign(n,0);
cin(v);

dq.clear();
dp.assign(n+1 , -1);

cout << rec(0) << nl;


}


int main(){
                                   FastCode ;
                                  //   Zainab() ;


    int testCase=1;
         cin >> testCase ;
      for(int i=1 ; i<= testCase ; i++)
        myCode(i);

    return 0;
}