#include<iostream>
#include<ctime>
#include<map>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
typedef long long ll;
void solve()
{
	int n;
	cin >> n;
	vector<int>v(n + 1);
	for(int i=1;i<=n;i++)
	{
		cin >> v[i];
	}
	stack<int>stk;
	vector<int>l(n + 1), r(n + 1);
	for (int i = 1; i <= n; i++)
	{
		while (!stk.empty() && v[i] > v[stk.top()])
			stk.pop();
		if (stk.empty())
			l[i] = 1;
		else
			l[i] = stk.top()+1;
		stk.push(i);
	}
	while (!stk.empty())
		stk.pop();
	for (int i = n; i >= 1; i--)
	{
		while (!stk.empty() && v[i] > v[stk.top()])
			stk.pop();
		if (stk.empty())
			r[i] = n;
		else
			r[i] = stk.top();
		if (r[i] >= 2 && v[r[i]-1] == v[i])
			r[i] = i;
		stk.push(i);
	}
	int 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();
	}
}