#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=2e5+9;
int a[N];
void solve()
{
    int n,top=0;cin>>n;
    vector<int> stk(n+1),b(n+1);
    ll ans=0;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        while(!stk.empty()&&a[stk.back()]<a[i]) stk.pop_back();
        if(stk.empty()) ans+=i-1;
        else if(a[stk.back()]==a[i]) b[i]=b[stk.back()],ans+=b[i],stk.pop_back();
        else ans+=i-stk.back()+b[stk.back()],b[i]=b[stk.back()]+1;
        stk.push_back(i);
    }   
    cout<<ans<<'\n';
}
int main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int _=1;cin>>_;
    while(_--) solve();
    return 0;
}