#include <bits/stdc++.h>
using namespace std;
 
const int N = 2e5 + 10;
int n, a[N], lef[N], rig[N];
stack<int> s;
 
inline int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') f = -1; c = getchar(); }
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
 
int main () {
    int t = read();
    while (t--) {
        n = read();
        for (int i = 1; i <= n; i++) a[i] = read();
        for (int i = 1; i <= n; i++) {
            if (s.empty() || a[i] < a[s.top()]) s.push(i);
            else {
                while (!s.empty() && a[i] >= a[s.top()]) {
                    rig[s.top()] = i;
                    s.pop();
                }
                s.push(i);
            }
        }
        while (!s.empty()) rig[s.top()] = n + 1, s.pop();
        for (int i = n; i; i--) {
            if (s.empty() || a[i] < a[s.top()]) s.push(i);
            else {
                while (!s.empty() && a[i] >= a[s.top()]) {
                    lef[s.top()] = i;
                    s.pop();
                }
                s.push(i);
            }
        }

        long long ans = 0LL;
        for (int i = 1; i <= n; i++) {
            if (!lef[i] || a[lef[i]] != a[i]) ans += rig[i] - lef[i] - 2;
            else ans += rig[i] - i - 1;
        }
        printf("%lld\n", ans);
    }
    return 0;
}