#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

void solve()
{
	int ans=0;
    int n;cin>>n;
    int a[n+1],lef[n+1],rit[n+1];
    for(int i=1;i<=n;i++) {cin>>a[i];}

    stack<int> stk1,stk2;

    for(int i=1;i<=n;i++)
    {
        int isPush = 0;
        while(stk1.size())
        {
            if(a[stk1.top()]>=a[i])
            {
                lef[i]=stk1.top();
                stk1.push(i);
                isPush=1;
                break;
            }
            else stk1.pop();
        }
        if(isPush==0 and stk1.empty())
        {
            stk1.push(i);
            lef[i]=0;
        }
    }

    for(int i=n;i>=1;i--)
    {
        int isPush = 0;
        while(stk2.size())
        {
            if(a[stk2.top()]>=a[i])
            {
                rit[i]=stk2.top();
                stk2.push(i);
                isPush=1;
                break;
            }
            else stk2.pop();
        }
        if(isPush==0 and stk2.empty())
        {
            stk2.push(i);
            rit[i]=0;
        }
    }

    for(int i=1;i<=n;i++)
    {
        if(a[rit[i]]==a[i])
        {
            if(lef[i]!=0) ans+=i-lef[i]-1; else ans+=i-1;
        }
        else
        {
            if(lef[i]!=0) ans+=i-lef[i]-1; else ans+=i-1;
            if(rit[i]!=0) ans+=rit[i]-i-1; else ans+=n-i;            
        }
    }

    cout<<ans<<endl;

}
/*

*/
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}