#include <iostream>
#include <vector>
using namespace std;

int main() {
    int t;
    cin >> t;  // Number of test cases
    
    while (t--) {
        int n;
        cin >> n;  // Length of the array
        
        vector<int> a(n);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];  // Array elements
        }

        int operations = 0;
        
        // We start from the last element and count operations needed to make the array uniform
        int max_element = a[n - 1];
        int i = n - 2;

        while (i >= 0) {
            if (a[i] != max_element) {
                // Perform one operation
                operations++;
                // Change all elements before current i to max_element
                max_element = a[i];
                // Skip to the part where values are different from the current max
                while (i >= 0 && a[i] == max_element) {
                    i--;
                }
            } else {
                i--;
            }
        }

        cout << operations << endl;
    }

    return 0;
}