#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;
    map<int,int> mp;
    int maxx=0;
    for(int i=0;i<n;i++){
        cin>>v[i];
        mp[v[i]]++;
        s.insert(v[i]);
        maxx=max(maxx,v[i]);
    }
    int ans=0;
    for(auto t:s){
        while(mp[t]){
            for(int i=0;i<n;i++){
                if(mp[maxx]==n){
                    cout<<ans<<endl;
                    return ;
                }
                if(v[i]==t){
                    int l=i-1,r=i+1;
                    int minn=0;
                    if(l>=0)minn=max(minn,v[l]);
                    if(r<n)minn=max(minn,v[r]);
                    if(minn==t)continue;
                    mp[v[i]]--;
                    v[i]=minn;
                    mp[minn]++;
                    ans++;
                }
            }
        }
    }
}


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