#include <bits/stdc++.h>
#define int long long
#define vv vector
using namespace std;
using PII = pair<int, int>;

void solve() {
	int n; cin >> n;
    vv<int> a(n + 1);
    for (int i = 1; i <= n; i ++ ) cin >> a[i];
    stack<int> st;
    map<int, int> val;
    int ans = 0;
    for (int i = 1; i <= n; i ++ ) {
        int cnt = 0;
        while (st.size() && st.top() < a[i]) {
            ans += cnt;
            cnt += val[st.top()];
            val.erase(st.top());
            st.pop();
        } 
        if (st.size() && st.top() == a[i]) val[st.top()] += 1;
        else st.push(a[i]), val[a[i]] = cnt + 1;
        ans += cnt;
    }
    cout << ans << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1; cin >> tt;
	while (tt -- ) solve();
	return 0;
}