#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t;cin>>t;
	while(t--)
	{
		int n;cin>>n;long long int mx=0;
		vector <long long int> a(n,0); 
		for(int i=0;i<n;i++) cin>>a[i];
		map <long long int , vector<int> > ma;
		for(int i=0;i<n;i++)
		{
			ma[a[i]].push_back(i);	
			mx=max(mx,a[i]);
		} 
		long long int ans=0;
		auto it=ma.begin();
		while(ma[mx].size()<n)
		{
			auto it=ma.begin();
			for(int i=0;i<it->second.size();i++)
			{
				int zuo=it->second[i]-1,you=it->second[i]+1;
				if(zuo==-1)
				{
					if(a[you]>it->first) {ma[a[you]].push_back(it->second[i]);a[it->second[i]]=a[you];it->second.erase(it->second.begin()+i);i--;ans++;continue;}
				}
				else if(you==n)
				{
					if(a[zuo]>it->first) {ma[a[zuo]].push_back(it->second[i]);a[it->second[i]]=a[zuo];it->second.erase(it->second.begin()+i);i--;ans++;continue;}
				}
				else
				{
					if(a[zuo]>it->first&&a[you]>it->first)
					{
						if(a[zuo]<=a[you]) {ma[a[zuo]].push_back(it->second[i]);a[it->second[i]]=a[zuo];it->second.erase(it->second.begin()+i);i--;ans++;continue;}
						else {ma[a[you]].push_back(it->second[i]);a[it->second[i]]=a[you];it->second.erase(it->second.begin()+i);i--;ans++;continue;}
					}
					else if(a[zuo]>it->first)
					{
						{ma[a[zuo]].push_back(it->second[i]);a[it->second[i]]=a[zuo];it->second.erase(it->second.begin()+i);i--;ans++;continue;}
					}
					else if(a[you]>it->first)
					{
						{ma[a[you]].push_back(it->second[i]);a[it->second[i]]=a[you];it->second.erase(it->second.begin()+i);i--;ans++;continue;}
					}
				}
			}
			if(it->second.size()==0) ma.erase(it);
			/*for(auto i=ma.begin();i!=ma.end();i++) 
			{cout<<"        "<<i->first<<": "; 
				for(int k=0;k<i->second.size();k++) cout<<i->second[k]<<" ";
			}cout<<'\n';*/
		}
		cout<<ans<<'\n';
	}	
	return 0;
}