#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

int n,a[N];
int stk[N],tt;
int L[N],R[N];

auto solve(){
	
	cin >> n;
	for(int i = 1;i <= n;i ++ ) cin >> a[i];
	
	tt = 0;
	for(int i = 1;i <= n;i ++ ){
		while(tt && a[stk[tt]] < a[i]) tt -- ;
		if(tt) L[i] = stk[tt];
		else L[i] = 0;
		stk[++tt]=i;
	}
	tt = 0;
	for(int i = n;i >= 1;i -- ){
		while(tt && a[stk[tt]] < a[i]) tt -- ;
		if(tt) R[i] = stk[tt];
		else R[i] = n + 1;
		stk[++tt]=i;
	}
	
	LL ans = 0;
	for(int i = 1;i <= n;i ++ ){
		ans += (i - L[i] - 1);
		if(R[i] <= n && a[R[i]] != a[i]) ans += (R[i] - i - 1);
	}
	
	//for(int i = 1;i <= n;i ++ ) cout << i << ' ' << L[i] << ' ' << R[i] << '\n';
	
	cout << ans << '\n';
}

signed main(){
	IOS
	int T = 1;
	cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}