#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
ll e[N],l[N],r[N],stk[N],top;
void solve()
{
	ll n;
	cin >> n;
	for(ll i = 1;i <= n;i ++)
	cin >> e[i];
	top = 0;
	stk[top] = 0;
	for(int i = 1;i <= n;i ++)
	{
		while(top && e[i] > e[stk[top]])
		top --;
		l[i] = stk[top] + 1;
		stk[++ top] = i;
	}
	top = 0;
	stk[top] = n + 1;
	e[n + 1] = 0;
	for(ll i = n;i >= 1;i --)
	{
		while(top && e[i] > e[stk[top]])
		top --;
		r[i] = stk[top] - 1;
		stk[ ++ top] = i;
		if(e[r[i] + 1] == e[i])
		r[i] = i;
		stk[++ top] = i;
	}
	ll ans = 0;
	for(int i = 1;i <=n ;i ++)
	ans += r[i] - l[i];
	cout << ans << endl;
}
int main()
{
	ios :: sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while(t --)
	solve();
	return 0; 
 }