#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define pq priority_queue<int>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define debug1(x) cout<<x<<endl;
#define debug2(a,b) cout<<a<<" "<<b<<endl;
const int INF = 0x3f3f3f3f;//无穷大
const int inf = 0xc0c0c0c0;//无穷小
const int MOD = 1;
const int N = 1;

/*
 ________  ___  ___  ___  _______   ________ ________   ___  ________   ________
|\   ____\|\  \|\  \|\  \|\  ___ \ |\  _____\\   ___  \|\  \|\   ___  \|\   ____\
\ \  \___|\ \  \\\  \ \  \ \   __/|\ \  \__/\ \  \\ \  \ \  \ \  \\ \  \ \  \___|
 \ \  \    \ \   __  \ \  \ \  \_|/_\ \   __\\ \  \\ \  \ \  \ \  \\ \  \ \  \  ___
  \ \  \____\ \  \ \  \ \  \ \  \_|\ \ \  \_| \ \  \\ \  \ \  \ \  \\ \  \ \  \|\  \
   \ \_______\ \__\ \__\ \__\ \_______\ \__\   \ \__\\ \__\ \__\ \__\\ \__\ \_______\
    \|_______|\|__|\|__|\|__|\|_______|\|__|    \|__| \|__|\|__|\|__| \|__|\|_______|
                                                                                     */


void ChiefNing()
{
    int n;
    cin>>n;
    vector<int> v(n);
    set<int> s;
    int Max_Cnt=0;
    for(int i=0;i<n;i++){
        cin>>v[i];
        s.insert(v[i]);
    }
    map<int,int> mp,mpp;
    int now=1;
    for(auto a:s){
        mp[a]=now++;
    }
    now--;
    for(int i=0;i<n;i++){
        v[i]=mp[v[i]];//离散化
        mpp[v[i]]++;
    }
    int ans=0;
    queue<tuple<int,int,int>> qp;
    for(int i=0;i<n;i++){
        if(v[i]==1){
            qp.push({1,i-1,i+1});
        }
        if(v[i]==now)Max_Cnt++;
    }
    int kn=1;
    while(Max_Cnt!=n){
        auto [i,l,r]=qp.front();
        qp.pop();
        int L=INF,R=INF;
        int kk=2;
        if(l!=-1&&v[l]!=kn){
            L=v[l];
            kk--;
        }
        if(r!=n&&v[r]!=kn){
            R=v[r];
            kk--;
        }
        int Min=min(L,R);
        if(Min==i||kk==2){
            qp.push({i,l,r});
            continue;
        }//1 1 1 2 2 2 2
        ans++;
        v[l+1]=Min;
        if(Min==now)Max_Cnt++;
        if(qp.empty()){
            kn++;
            for(int ii=0;ii<n;ii++){
                if(v[ii]==kn)qp.push({kn,ii-1,ii+1});
            }
        }
    }
    cout<<ans<<endl;
}

signed main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int _;
    cin>>_;
    while(_--)
        ChiefNing();
    return 0;
}