#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define int long long
#define double long double
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
using namespace std;

void solve() {
    int ans = 0;
    int n;
    cin >> n;
    vector<int> a(n + 2, 0x3f3f3f3f); // Fill with MAXN
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    vector<PII> vec;
    int count = 1;

    for (int i = 2; i <= n + 1; i++) {
        if (a[i] != a[i - 1]) {
            vec.pb({a[i - 1], count});
            count = 1;
        } else {
            count++;
        }
    }

    set<int> unique_elements;
    for (int i = 1; i <= n; i++) {
        unique_elements.insert(a[i]);
    }

    for (auto it = unique_elements.begin(); it != unique_elements.end(); ++it) {
        int tg = *it;
        if (tg == *unique_elements.rbegin()) break;

        for (int i = 0; i < vec.size(); i++) {
            if (vec[i].fi == tg) {
                ans += vec[i].se;
                if (i == 0 || (i < vec.size() - 1 && vec[i + 1].fi < vec[i - 1].fi)) {
                    vec[i + 1].se += vec[i].se;
                } else {
                    vec[i - 1].se += vec[i].se;
                }
                vec.erase(vec.begin() + i);
                i--; // Adjust index after erase
            }
        }
    }

    cout << ans << endl;
}

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