#include<bits/stdc++.h>

using namespace std;

const int N = 200010;

void solve(){
	int n;
	cin >> n;

	vector<int> a(n + 1), l(n + 1), r(n + 1), d(n + 1);

	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	stack<int> st;
	int root = 0;

	for(int i = 1; i <= n; i++){
		int last = 0;
		while(!st.empty() && a[st.top()] < a[i]){
			last = st.top();
			st.pop();
		}
		if(!st.empty()) r[st.top()] = i;
		else root = i;

		st.push(i);
		l[i] = last;
	}

	int ans = 0;
	auto dfs = [&](auto self, int u) -> void{
		if(!l[u] && !r[u]) d[u] = 1;
		if(l[u]){
			self(self, l[u]);
			d[u] = d[l[u]] + 1;
			if(a[u] != a[l[u]]) ans += d[l[u]];
		}
		if(r[u]){
			self(self, r[u]);
			d[u] = d[r[u]] + 1;
			if(a[u] != a[r[u]]) ans += d[r[u]];
		}
	};
	dfs(dfs, root);

	cout << ans << '\n';
}

int main(void){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int T;
	cin >> T;
	while(T--){
		solve();
	}

	return 0;
}