#include<bits/stdc++.h>
using namespace std;
#define ll long long 
const int N=2e5+5;
ll t,n;
vector<int>visit;
struct xy{
   ll zhi;
   int point;
}a[N];
bool cmp(xy x,xy y){
	return x.zhi>y.zhi;
}
void solve(){
	cin>>n;
	ll sum=0;
	visit.clear();
	for(int i=0;i<n;i++){cin>>a[i].zhi;a[i].point=i;}
	sort(a,a+n,cmp);
    ll x=a[0].zhi,k=0;
    visit.push_back(a[0].point);
    for(k=1;k<n;k++){
    	if(a[k].zhi!=x)break;
    	visit.push_back(a[k].point);
	}
	for(int i=k;i<n;i++){
		x=a[i].zhi;
		int v1=-1,w=i;
		while(x==a[w].zhi&&w<n){
			int u=a[w].point;
			int v=upper_bound(visit.begin(),visit.end(),u)-visit.begin();
//			cout<<sum<<endl;
			if(v==0&&v!=v1){
				sum+=visit[v];
				v1=v;
			}
			else if(v==visit.size()&&v!=v1){
				sum+=n-visit[v-1]-1;
				v1=v;
			}
			else{
				if(v!=v1){
				    sum+=visit[v]-visit[v-1]-1;
				    v1=v;
				}
			}
			auto p=upper_bound(visit.begin(),visit.end(),u);
			visit.insert(p,u);
			v1++;
			w++;
		}
/*		for(int k=i;i<w;i++){
			int u=a[i].point;
			auto v=upper_bound(visit.begin(),visit.end(),u);
			visit.insert(v,u);
		}*/
		i=w-1;
	}
	cout<<sum<<endl;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}