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

typedef long long ll;

void solve()
{
	int n;
	cin >> n;
	vector<int> a(n + 1);
	for(int i = 1; i <= n; i++) cin >> a[i];
	
	vector<int> stk(n + 2), l(n + 2), r(n + 2);
	int top = 0;
	stk[top] = 0;
	for(int i = 1; i <= n; i++)
	{
		while(top && a[i] > stk[top]) top--;
		l[i] = stk[top] + 1;
		stk[++top] = i;
	}
	
	top = 0;
	stk[top] = n + 1;
	for(int i = n; i >= 1; i--)
	{
		while(top && a[i] > stk[top]) top--;
		r[i] = stk[top] - 1;
		if(a[stk[top]] == a[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()
{
	int t;
	cin >> t;
	while(t--)
	{
		solve();
	}
	return 0;
}