#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

int a[200200];
void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    stack<int>stk;
    vector<int>l(n + 1);
    vector<int>r(n + 1);
    for (int i = 0; i < n; i++) {
        while (!stk.empty() && a[stk.top()] < a[i]) {
            stk.pop();
        }
        if (stk.empty()) {
            l[i] = 0;
        }
        else {
            l[i] = stk.top()+1;
        }
        stk.push(i);
    }
    while (!stk.empty()) {
        stk.pop();
    } 
    for (int i = n-1; i >=0; i--) {
        while (!stk.empty() && a[stk.top()] < a[i]) {
            stk.pop();
        }
        if (stk.empty()) {
            r[i] = n-1;
        }
        else {
            r[i] = stk.top() - 1;
        }
        if(r[i]<n-1&&a[r[i]+1]==a[i]){
            r[i]=i;
        }
        
        
        stk.push(i);
    }
    int sum=0;
    for(int i=0;i<n;i++){
        sum+=r[i]-l[i];
    }
    cout<<sum<<endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout.precision(10); cout.setf(ios::fixed);
    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}