#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define f(x) for(ll i = 1;i <= n; i++)
ll t, n, ans;
ll a[500005], l[500005], r[500005];
stack <ll>q ;

void solve()
{
    ans = 0;
    cin>>n;
    f(n)
    {
        l[i] = 0;
        r[i] = n + 1;
    }
    ll maxx = 0;
    for(int i = 1 ; i <= n;i++)
    {
        cin >> a[i];
        maxx = max(maxx, a[i]);
    }
    f(n)
    {
        while(!q.empty() && a[q.top()] < a[i])
        {
            q.pop();
        }
        if(!q.empty()) { if (a[q.top()] == a[i])l[i] = i - 1; }
        q.push(i);
    }
    while(!q.empty()) q.pop();
    f(n)
    {
        while(!q.empty() && a[q.top()] < a[n - i + 1])
        {
            q.pop();
        }
        if(!q.empty()) r[n - i + 1] = q.top();
        q.push(n - i + 1);
    }
    while(!q.empty()) q.pop();

    f(n)
    {
       ans += r[i] - l[i] - 2;
    }
    cout<<ans<<endl;
}
int main ()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>t;
    while(t--)
    {
        solve();
    }

    return 0;
}