#include<bits/stdc++.h>
using namespace std;

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=2;
const ll MAX=1000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;



void solve(){
    ll t;cin>>t;
    while(t--){
        ll n;cin>>n;
        vector<ll>a(n);
        rep(i,n)cin>>a[i];
        rep(i,n)a[i]--;
        vector<ll>c(n);
        rep(i,n)c[a[i]]=i;
        vector<ll>b(n);
        ll ma=0,ans=0;
        rep(i,n){
            ll id=c[i];
            ll cn=0;
            b[id]=1;
            if(id>0){
                if(b[id-1]==0)cn++;
                else cn--;
            }
            if(id+1<n){
                if(b[id+1]==0)cn++;
                else cn--;
            }
            ans+=cn;
            ma=max(ans,ma);
        }
        cout<<ma+1<<endl;
    }
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}