#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N=2e5+5;
void solve()
{
    int n;
    cin>>n;
    vector<int>a(n+2);
    for(int i=1;i<=n;i++) cin>>a[i];
    a[0]=1e9+10,a[n+1]=1e9+10;
    vector<int>stk;
    stk.push_back(0);
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        while(!stk.empty()&&a[stk.back()]<a[i])
        {
            stk.pop_back();
        }
        ans+=i-stk.back()-1;
        stk.push_back(i);
    }
    stk.clear();
    stk.push_back(n+1);
    for(int i=n;i>=1;i--)
    {
        while(!stk.empty()&&a[stk.back()]<a[i])
        {
            stk.pop_back();
        }
        if(a[stk.back()]==a[i]) ans+=stk.back()-i-1;
        stk.push_back(i);
    }
    cout<<ans<<endl;
}
int main()
{
    IOS;
    int t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}