#include "bits/stdc++.h"

using namespace std;
using i64 = int64_t;

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

    list<int> l;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
    vector<int> cnt(n, 1);
    vector<list<int>::iterator> d(n);
    for (int i = 0; i < n; i++) {
        q.emplace(a[i], i);
        l.push_back(i);
        d[i] = prev(l.end());
    }

    int ans = 0;
    while (!q.empty() && l.size() > 1) {
        auto [ai, i] = q.top();
        q.pop();
        int mn = 1e9;int id;
    auto it = d[i];int j;
        if (it != prev(l.end())){
            mn = a[*next(it)];
            id = *next(it);
        }
        if (it != l.begin() && a[*prev(it)] < mn){
            mn = a[*prev(it)];
            id = *prev(it);
        }
        cnt[j] += cnt[i];
        if (mn != a[i]){ // hebing
            ans += cnt[i];
        }
        

        l.erase(it);
    }
    cout << ans << '\n';
}

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

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}