#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned int;
#define rep(i,n) for(int i=0; i<(n); i++)


void testcase(){
    int N; cin >> N;
    vector<int> iP(N);
    rep(i,N){ int p; cin >> p; p--; iP[p] = i; }

    vector<int> flag(N, 0);
    int nowans = 1;
    int ans = 1;
    rep(i,N){
        int p = iP[i];
        if(p != 0) if(flag[p] != flag[p-1]) nowans--;
        if(p != N-1) if(flag[p] != flag[p+1]) nowans--;
        flag[p] ^= 1;
        if(p != 0) if(flag[p] != flag[p-1]) nowans++;
        if(p != N-1) if(flag[p] != flag[p+1]) nowans++;
        ans = max(ans, nowans);
    }
    cout << ans << "\n";
}


int main() {
    int T; cin >> T;
    while(T--) testcase();
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;