#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define int long long
#define ull unsigned long long
#define ii __int128
#define endl '\n'
#define pii pair<int,int>
#define fi first
#define se second
//#define ls p<<1
//#define rs p<<1|1
using namespace std;
const double pi=acos(-1.0);

const int mod=998244353;
const int N=2e5+5;

int n;
int a[N],l[N],r[N],sz[N],p[N],mx[N];
int find(int x){return x==p[x]?x:p[x]=find(p[x]);}
void merge(int x,int y){
	int fx=find(x),fy=find(y);
	if(fx^fy){
		sz[fx]+=sz[fy];
		mx[fx]=max(mx[fx],mx[fy]);
		l[fx]=min(l[fx],l[fy]);
		r[fx]=max(r[fx],r[fy]);
		p[fy]=p[fx];
	}
}
void solve(){
	cin>>n;
	priority_queue<tuple<int,int,int>>q;
	for(int i=1;i<=n;++i){
		cin>>a[i];
		mx[i]=a[i];
		p[i]=l[i]=r[i]=i,sz[i]=1;
		if(a[i]==a[i-1])merge(i-1,i);
	}
	for(int i=1;i<=n;++i)if(i==find(i)){
		q.push({-a[i],l[i],r[i]});
	}
	a[0]=1e9+10;
	mx[0]=a[0];sz[0]=1;
	p[n+1]=l[n+1]=r[n+1]=n+1;
	mx[n+1]=1e9+10;sz[n+1]=1;
	int ans=0;
	a[n+1]=1e9+10;
	while(q.size()>1){
		auto [val,li,ri]=q.top();q.pop();
		
		val*=-1;
		int fx=find(li);
		if(l[fx]==1&&r[fx]==n)break;
		if(mx[fx]!=val||li!=l[fx]||ri!=r[fx])continue;
		//cout<<val<<' '<<li<<' '<<ri<<' '<<l[fx]<<' '<<r[fx]<<endl;
		int lc=l[fx]-1,rc=r[fx]+1;
		int fl=find(lc),fr=find(rc);
		if(mx[fl]==mx[fr]){
			ans+=sz[fx];
			merge(fl,fr);
			merge(fl,fx);
			//cout<<"??:"<<-mx[fl]<<' '<<l[fl]<<' '<<r[fl]<<endl;
			q.push({-mx[fl],l[fl],r[fl]});
		}else{
			if(mx[fl]>mx[fr])swap(fl,fr);
			ans+=sz[fx];
			merge(fl,fx);
			q.push({-mx[fl],l[fl],r[fl]});
		}
	}
	cout<<ans<<endl;
}

signed main(){
	IOS;
	int _=1;
	cin>>_;
	while(_--)
		solve();
	return 0;
}