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

const int N = 2e5 + 7;
int a[N];
int stk[N];
int l[N], r[N];
int main() {
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		for (int i = 1; i <= n; i++) cin >> a[i];
		a[n + 1] = 0;
		int idx = 0;
		int ans = 0;
		stk[0] = 0;
		for (int i = 1; i <= n; i++) {
			while (idx && a[i] > a[stk[idx]]) idx--;
			l[i] = stk[idx] + 1;
			stk[++idx] = i;
		}
		stk[0] = n + 1;
		idx = 0;
		for (int i = n; i >= 1; i--) {
			while (idx && a[i] > a[stk[idx]]) idx--;
			r[i] = stk[idx] - 1;
			if(a[r[i] + 1] == a[i]) r[i] = i;
			stk[++idx] = i;
		} 
		for (int i = 1; i <= n; i++) {
			ans += (r[i] - l[i]);
		}
		cout << ans << "\n";
	}
	return 0;
}