#include <bits/stdc++.h>

using LL = long long;
constexpr int N = 2e5 + 10;

int stk[N], top = -1;
int l[N], r[N];

void solve() {
    int n;
    std::cin >> n;
    std::vector<int> a(n + 2);
    for (int i = 1; i <= n; i++) {
        std::cin >> a[i];
    }
    top = -1;
    stk[++top] = 0;
    for (int i = 1; i <= n; i++) {
        while (top != 0 && a[stk[top]] <= a[i]) {
            top--;
        }
        l[i] = stk[top];
        stk[++top] = i;
    }
    top = -1;
    stk[++top] = n + 1;
    for (int i = n; i >= 1; i--) {
        while (top != 0 && a[stk[top]] <= a[i]) {
            top--;
        }
        r[i] = stk[top];
        stk[++top] = i;
    }
    std::vector<int> p(n + 1), dp(n + 2);
    std::iota(p.begin() + 1, p.end(), 1);
    dp[0] = dp[n + 1] = -1;
    std::sort(p.begin() + 1, p.end(),
              [&](int x, int y) { return a[p[x]] > a[p[y]]; });
    LL ans = 0;
    for (int i = 1; i <= n; i++) {

        if (l[p[i]] == 0 || r[p[i]] == n + 1 || a[l[p[i]]] == a[r[p[i]]]) {
            dp[p[i]] = std::max(dp[l[p[i]]], dp[r[p[i]]]) + 1;
        } else {
            dp[p[i]] = std::max(dp[l[p[i]]], dp[r[p[i]]]) + 2;
        }
        ans += 1LL * dp[p[i]];
    }
    std::cout << ans << '\n';
}

int main() {
    // freopen("ans.in", "r", stdin);
    // freopen("ans.out", "w", stdout);
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    int T;
    std::cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}