#include <algorithm>
#include <iostream>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using pii = pair<int, int>;

vector<int> a;

void run(){
    int n;
    cin>>n;
    a.resize(n+10);
    int64_t res = 0;
    for(int i = 0; i < n; i++){
        cin>>a[i];
    }
    vector<pii> stk = {{a[0],0}};
    for(int i = 0; i < n; i++){
        if(a[i]==stk.back().first) stk.back().second++;
        else{
            int siz = 0;
            while(stk.size()&&stk.back().first<a[i]){
                siz += stk.back().second;
                stk.pop_back();
            }
            res += siz;
            stk.push_back({a[i],siz+1});
        }
    }

    stk = {{a[n-1],0}};
    for(int i = n-1; i >= 0; i--){
        if(a[i]==stk.back().first) stk.back().second++;
        else{
            int siz = 0;
            while(stk.size()&&stk.back().first<a[i]){
                siz += stk.back().second;
                stk.pop_back();
            }
            res += siz;
        }
    }

    cout<<res<<endl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int T;
    cin>>T;
    while(T--){
        run();
    }
}