#include <iostream>
#include <stack>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 2e5 + 5;
#define int long long
int t[N];
void solve()
{
	int n;
	cin >> n;
	vector<int> id[100], arr;
	for (int i = 0; i < n; i++) {
		cin >> t[i];
		arr.push_back(t[i]);
	}
	sort(arr.begin(), arr.end());
	arr.erase(unique(arr.begin(), arr.end()), arr.end());

	for (int i = 0; i < n; i++) {
		t[i] = lower_bound(arr.begin(), arr.end(), t[i]) - arr.begin();
		id[t[i]].push_back(i);
	}
	stack<int> s;
	vector<int> l(n), r(n), ans(n);
	for (int i = 0; i < n; i++) {
		while (!s.empty() && t[i] >= t[s.top()])
			s.pop();
		l[i] = s.empty() ? -1 : s.top();
		s.push(i);
	}
	while (!s.empty())
		s.pop();
	for (int i = n - 1; i >= 0; i--) {
		while (!s.empty() && t[i] >= t[s.top()])
			s.pop();
		r[i] = s.empty() ? -1 : s.top();
		s.push(i);
	}
	for (int i = arr.size() - 1; i >= 0; i--) {
		for (auto j : id[i]) {
			int fa;
			if (l[j] == -1 && r[j] == -1)
				continue;
			else if (l[j] == -1)
				fa = r[j];
			else if (r[j] == -1)
				fa = l[j];
			else if (t[l[j]] > t[r[j]])
				fa = r[j];
			else
				fa = l[j];
			ans[j] = ans[fa] + 1;
		}
	}

	int anss = 0;
	for (int i = 0; i < n; i++) 
		anss += ans[i];
	cout << anss << endl;
}
signed main()
{
	int tt;
	cin >> tt;
	while (tt--)
		solve();
	return 0;
}