// Try CF Partner: https://github.com/YuiHrsw/CF-Partner

#ifndef ONLINE_JUDGE
#include "D:/debug.h"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>

using namespace std;

using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128;

constexpr i64 inf = 1e18;

template <class T>
using vec = vector<T>;
template <class T>
using vec2 = vec<vec<T>>;
template <class T>
using pqueue = priority_queue<T>;
template <class T>
using pqueue1 = priority_queue<T, vec<T>, greater<T>>;

template <class T>
void chmax(T& x, T y) { x = max(x, y); }
template <class T>
void chmin(T& x, T y) { x = min(x, y); }

// #define int i64

void solve() {
    int n;
    cin >> n;
    vec<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    vec<int> l(n), r(n);
    for (int i = 0; i < n; i++) l[i] = r[i] = i;

    vec<int> st;
    for (int i = 0; i < n; i++) {
        while (!st.empty() && a[st.back()] <= a[i]) {
            r[st.back()] = i - 1;
            st.pop_back();
        }
        st.push_back(i);
    }
    // st.clear();
    while (!st.empty()) {
        r[st.back()] = n - 1;
        st.pop_back();
    }
    for (int i = n - 1; i >= 0; i--) {
        while (!st.empty() && a[st.back()] <= a[i]) {
            l[st.back()] = i + 1;
            st.pop_back();
        }
        st.push_back(i);
    }
    while (!st.empty()) {
        l[st.back()] = 0;
        st.pop_back();
    }

    // debug(l);
    // debug(r);
    // cout << "ok\n";
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (l[i] == r[i]) continue;
        ans += r[i] - i;
        if (l[i] > 0 && a[l[i] - 1] == a[i]) continue;
        ans += i - l[i];
    }
    cout << ans << '\n';
}

#undef int

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) solve();

    return 0;
}