#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e5+10;
struct Node{
	int lson,rson;
}tree[MAXN];
int T,n,a[MAXN],ans;
void dfs(int u,int l,int r){
	
	if(tree[u].lson){
		if(a[tree[u].lson]!=a[u]) ans+=u-l;
		dfs(tree[u].lson,l,u-1);
	}
	if(tree[u].rson){
		if(a[tree[u].rson]!=a[u]) ans+=r-u;
		dfs(tree[u].rson,u+1,r);
	}
}
signed main(){
	cin>>T;
	while(T--){
		ans = 0;
		cin>>n;
		for(int i=1;i<=n;i++) cin>>a[i],tree[i].lson = tree[i].rson = 0;
		stack<pair<int,int> > s;
		int root = 0;
		for(int i=1;i<=n;i++){
			int last = 0;
			while(!s.empty()&&s.top().second>a[i]) last = s.top().first,s.pop();
			if(s.empty()){
				root = i;
				tree[i].lson = last;
			}
			else{
				tree[s.top().first].rson = i;
				tree[i].lson = last;
			}
			s.push({i,a[i]});
		}
		dfs(root,1,n);
		cout<<ans<<endl;
	}
}