#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }

        int operations = 0;
        int currentMax = a[0];
        int distinctCount = 1; // Count of distinct elements encountered so far

        for (int i = 1; i < n; ++i) {
            if (a[i] > currentMax) {
                currentMax = a[i];
                distinctCount = 1; // Reset distinct count as we found a new max
            } else if (a[i] < currentMax) {
                ++distinctCount;
            }

            if (distinctCount > 1) {
                ++operations;
                distinctCount = 1; // Reset after performing an operation
            }
        }

        cout << operations << endl;
    }

    return 0;
}