#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
const ll M=0x7fffffff;

inline ll read(){
    char c=getchar();ll _x=0, f=1;
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) _x=_x*10+c-'0';
    return _x*f;
}

ll t, n, m, head, ed_ans;
ll find_fir[N], lef_fir[N];
struct node{
	ll num, fir_ip, ans;
}a[N];

bool cmp(node x, node y){
	return x.num>y.num;
}

int main(){
	t=read();
	
	while( t-- ){
		ed_ans=0;
		n=read();
		for(int i=1;i<=n;i++) a[i].num=read();
		
		for(int i=n;i>=1;i--){
			while( head && a[ find_fir[head] ].num <= a[i].num ) head--;
			a[i].fir_ip = find_fir[head];
			find_fir[ ++head ] = i;
		}
		
		head=0;
		for(int i=1;i<=n;i++){
			while( head && a[ find_fir[head] ].num <= a[i].num ) head--;
			lef_fir[i] = find_fir[head];
			find_fir[ ++head ] = i;
		}
		
		for(int i=1;i<=n;i++)
			if( !a[i].fir_ip ) a[i].fir_ip = lef_fir[i];
			else if( a[ a[i].fir_ip ].num < a[ lef_fir[i] ].num && lef_fir[i] ) a[i].fir_ip = lef_fir[i];
		
		sort(a+1, a+n+1, cmp);
		
		for(int i=2;i<=n;i++){
			if( a[i].num==a[i-1].num ) continue;
			a[i].ans = a[ a[i].fir_ip ].ans+1;
			ed_ans+=a[i].ans;
		}
		
		printf("%lld\n", ed_ans);
	}
	
    return 0;
}