#include <bits/stdc++.h>

using i64 = long long;

struct DSU {
    std::vector<int> f, siz;
    
    DSU() {}
    DSU(int n) {
        init(n);
    }
    
    void init(int n) {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }   
    
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    
    int size(int x) {
        return siz[find(x)];
    }
};

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }

    std::vector<int> L(n, -1), R(n, -1);
    DSU dsu(n);
    for (int i = 0, j = 0; i < n; i = j) {
        while (j < n && a[i] == a[j]) {
            j++;
        }
        for (int k = i; k < j; k++) {
            dsu.merge(i, k);
        }
    }
    for (int i = 0; i < n; i++) {
        if (i && dsu.find(i) != dsu.find(i - 1)) {
            L[dsu.find(i)] = dsu.find(i - 1);
        }
        if (i != n - 1 && dsu.find(i) != dsu.find(i + 1)) {
            R[dsu.find(i)] = dsu.find(i + 1);
        }
    }

    std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, std::greater<>> pq;
    for (int i = 0; i < n; i++) {
        if (dsu.find(i) == i) {
            pq.emplace(a[i], i);
        }
    }

    i64 ans = 0;
    while (pq.size() > 1) {
        auto [x, y] = pq.top();
        pq.pop();

        if (dsu.find(y) != y) {
            continue;
        }
        ans += dsu.size(y);
        // std::cerr << y + 1 << " " << dsu.size(y) << " X \n";

        if (L[y] != -1 && R[y] != -1) {
            if (a[L[y]] < a[R[y]]) {
                //向 L 合并
                R[L[y]] = R[y];
                dsu.merge(L[y], y);
            } else if (a[L[y]] > a[R[y]]) {
                //向 R 合并
                L[R[y]] = L[y];
                dsu.merge(R[y], y);
            } else {
                //向 LR 合并
                int l = L[L[y]];
                int r = R[R[y]];
                dsu.merge(R[y], y);
                dsu.merge(R[y], L[y]);
                L[dsu.find(y)] = l;
                R[dsu.find(y)] = r;
            }
        } else if (L[y] != -1) {
            R[L[y]] = R[y];
            dsu.merge(L[y], y);
        } else if (R[y] != -1) {
            L[R[y]] = L[y];
            dsu.merge(R[y], y);
        }
    }
    std::cout << ans << "\n";
}

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

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}