#include<bits/stdc++.h>
using namespace std;
const int maxn=4e5+6;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >pq;
int T,cnt,ans,a[maxn],maxx,n;
struct node{
	int shang,xia,val,id;
}d[maxn]; 
int main(){
	ios::sync_with_stdio(false);
	cin>>T;
	while(T--){
		cin>>n;
		cnt=ans=maxx=0;
		while(pq.size())pq.pop();
		for(int i=1;i<=n;i++){
			cin>>a[i];maxx=max(a[i],maxx);
		}
		for(int i=1;i<=n;i++){
			if(a[i]==a[i-1]){
				if(a[i]!=maxx)d[cnt].val+=1;
			}else{
				cnt+=1;
				d[cnt].id=a[i];d[cnt-1].xia=cnt;d[cnt].shang=cnt-1;
				if(a[i]!=maxx)d[cnt].val=1;
				pq.push({d[cnt].id,cnt});
			}
			
		}
		for(int i=1;i<cnt;i++){
			int q=pq.top().second;
			pq.pop();
			if(d[q].shang==0){
				ans+=d[q].val;
				d[d[q].xia].shang=d[q].shang;
				d[d[q].xia].val+=d[q].val;
			}else if(d[q].xia==0){
				ans+=d[q].val;
				d[d[q].shang].xia=d[q].xia;
				d[d[q].shang].val+=d[q].val;
			}else if(d[d[q].shang].val>d[d[q].xia].val){
				ans+=d[q].val;
				d[d[q].xia].shang=d[q].shang;
				d[d[q].xia].val+=d[q].val;
			}else{
				ans+=d[q].val;
				d[d[q].shang].xia=d[q].xia;
				d[d[q].shang].val+=d[q].val;
			}
		}
		for(int i=1;i<=cnt;i++){
			d[i].id=d[i].shang=d[i].xia=d[i].val=0;
		}
		cout<<ans<<endl;
	}
	return 0;
}