#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

void solve()
{
	int ans=0;
    int n;cin>>n;
    int a[n+2];a[n+1]=MAXN;
    stack<PII> stk;
    for(int i=1;i<=n;i++) cin>>a[i];

    int js=0;
    for(int i=1;i<=n+1;i++)
    {
    	if(a[i]!=a[i-1])
    	{
    		if(js!=0)
    		{
    			stk.push({a[i-1],js});
    		}
    		js=1;
    	}
    	else
    	{
    		js++;
    	}
    }

    while(stk.size()>=3)
    {
    	PII aa=stk.top();stk.pop();
    	PII tg=stk.top();stk.pop();
    	PII bb=stk.top();stk.pop();
    	if(bb.fi<aa.fi)
    	{
    		stk.push(aa);
    		stk.push({max(bb.fi,tg.fi),bb.se+tg.se});
    		if(tg.fi>bb.fi) ans+=tg.se;
    		else ans+=bb.se;
    	}
    	else
    	{
    		stk.push({max(aa.fi,tg.fi),aa.se+tg.se});
    		stk.push(bb);
    		if(tg.fi>aa.fi) ans+=tg.se;
    		else ans+=aa.se;
    	}
    }

    if(stk.size()==2)
    {
    	PII aa=stk.top();stk.pop();
    	PII bb=stk.top();stk.pop();
    	if(aa.fi>bb.fi) ans+=bb.se;
    	else ans+=aa.se;
    }

    cout<<ans<<endl;

}
/*

w 1 1 1 4 4 4 3 3 3 2 2 4
1.3 4.3 3.3 2.2 4.1

1 2 3 4 5

4 1 1 3 2 4
1 1 1 2 2 2 2
1 4 3 2 4

4 1 3 2 4

5 1 2 4 3 5

2 4 3 2 1

*/
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}