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


#include<atcoder/segtree>
using dat = array<array<int,2>,2>;

dat op(dat a,dat b){
    dat c = {};
    for(int i = 0;i<2;i++) for(int j = 0;j<2;j++) c[i][j] = -1e9;
    for(int i = 0;i<2;i++) for(int j = 0;j<2;j++) for(int k = 0;k<2;k++) c[i][j] = max(c[i][j],a[i][k] + b[k][j]);
    return c;
}
dat e(){
    dat c = {};
    c[0][1] = c[1][0] = -1e8;
    return c;
}

void solve(){
    int n;
    cin>>n;
    vector<int> p(n);
    for(int i = 0;i<n;i++) cin>>p[i];
    for(int i = 0;i<n;i++) p[i]--;
    atcoder::segtree<dat,op,e> seg(n);
    int ans = 0;
    for(int i = 0;i<n;i++){
        dat now = {};
        now[1][0] = now[1][1] = -1e9;
        now[0][0] = 0;
        now[0][1] = 1;
        seg.set(i,now);
    }
    vector<int> idx(n,0);
    for(int i = 0;i<n;i++) idx[p[i]] = i;
    ans = max(ans,seg.all_prod()[0][0]);
    ans = max(ans,seg.all_prod()[1][1]);
    ans = max(ans,seg.all_prod()[1][0]);
    ans = max(ans,seg.all_prod()[0][1]);
    for(int i = 0;i<n;i++){
        int ni = idx[i];
        dat now = {};
        now[0][0] = now[0][1] = -1e9;
        now[1][1] = 0;
        now[1][0] = 1;
        seg.set(ni,now);
        ans = max(ans,seg.all_prod()[0][0]);
        ans = max(ans,seg.all_prod()[1][1]);
    ans = max(ans,seg.all_prod()[1][0]);
    ans = max(ans,seg.all_prod()[0][1]);
    }
    cout<<ans<<endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}