#include <bits/stdc++.h>
#define int long long
using namespace std;

int t{}, n{}, temp{};

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> t;
    while(t--) {
        cin >> n;
        stack<pair<int, int>> stk;
        int answer = 0;

        for (int i = 0; i < n; i++) {
            cin >> temp;
            if (stk.empty()) {
                stk.push({temp, 1});
            }
            else if (stk.top().first == temp) {
                // Merge with the previous group of same elements
                int cnt = stk.top().second + 1;
                stk.pop();
                stk.push({temp, cnt});
            }
            else if (stk.top().first < temp) {
                int add = 0;
                int cnt = 1;
                // Corrected here: Remove 'add += add;'
                while (!stk.empty() && stk.top().first < temp) {
                    add += stk.top().second; // Add only once per popped element
                    cnt += stk.top().second;
                    stk.pop();
                }
                answer += add;
                // Merge with existing same elements after popping smaller ones
                while (!stk.empty() && stk.top().first == temp) {
                    cnt += stk.top().second;
                    stk.pop();
                }
                stk.push({temp, cnt});
            }
            else {
                stk.push({temp, 1});
            }
        }

        int add = 0;
        // Corrected here: Remove 'add += add;'
        while (stk.size() > 1) {
            add += stk.top().second; // Add only once per popped element
            stk.pop();
        }

        cout << answer + add << '\n';
    }
}