#include <bits/stdc++.h>
#define lowbit(x) ((x)&(-x)) 
#define	fs first
#define sc second

using namespace std;

typedef long long ll;
const int MAXN = 2e5 + 5;
const ll inf = 2e18;
const ll MOD = 998244353;

int a[MAXN];

void solve(int Count_T) {
	
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	stack<pair<int, int>> s;
	ll ans = 0;
	for (int i = 1; i <= n; i++)
	{
		int sum = 1;
		while (!s.empty() && s.top().fs < a[i])
		{
			int val = s.top().fs, num = s.top().sc;
			s.pop();
			ans += sum - 1;
			sum += num;
		}
		ans += sum - 1;
		if (!s.empty() && s.top().fs == a[i])
		{
			sum += s.top().sc;
			s.pop();
		}
		s.push({ a[i], sum });
	}
	while (!s.empty())
	{
		int num = s.top().sc;
		s.pop();
		if (s.empty())
			break;
		ans += num;
	}
	cout << ans << '\n';
}

int main() {
	
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin >> T;
	for (int i = 1; i <= T; i++)
		solve(i);

	return 0;
}

/*
1
7
1 1 1 2 2 2 2
*/