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

#define endl '\n'
typedef long long LL;

void solve(){
    int n;
    cin >> n;
    vector<int> a(n + 2);
    a[0] = a[n + 1] = 1e9 + 1;
    stack<int> stk;
    vector<int> l(n + 1),r(n + 1);
    stk.push(0);
    for(int i = 1;i <= n;i++){
        while(stk.size() && a[stk.top()] < a[i])stk.pop();
        l[i] = stk.top();
        stk.push(i);
    }
    while(stk.size())stk.pop();
    stk.push(n + 1);
    for(int i = n;i >= 1;i--){
        while(stk.size() && a[stk.top()] < a[i])stk.pop();
        r[i] = stk.top();
        stk.push(i);
    }
    LL res = 0;
    for(int i = 1;i <= n;i++){
        res += r[i] - l[i] - 1;
    }
    



}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL),cout.tie(NULL);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}