#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e6 + 10,mod = 1e9 + 7;

int q[N];
void solve()
{
	int n;
	cin>>n;
	vector<int>a(n+1);
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	int id = 0, ans = 0;
	for(int i = 1; i <= n; i++)
	{
		int st = 0,idx = 0;
		while(id != 0 && a[i] >= q[id])
		{
			if(a[i]==q[id])
			st = 1;
			id--;
			idx++;
			
		}
		
//		if(st)
//		{
//			ans-=idx - 1;
//		}
		
		ans += id;
//		cout<<idx<<" "<<st<<'\n';
		q[++id] = a[i];
		
	}
	id = 0;
	for(int i = n; i >= 1; i--)
	{
		int st = 0,idx = 0;
		while(id != 0 && a[i] >= a[q[id]])
		{
			if(a[i]==a[q[id]])
			st = q[id];
			id--;
			idx++;
		}
		
		if(st&&idx!=1)
		ans-=st - i - 1;
		
		ans += id;
//		cout<<idx<<" "<<st<<"::\n";
		q[++id] = i;
		
	}
	cout << ans;
}
signed main()
{
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0); 
	int _ = 1;
	cin>>_;
	while(_--)
	{
		solve();
		if(_>0)
		cout<<'\n';
	}	
}