#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;
        bool canOperate = false;
        int maxElem = a[0];

        for (int i = 0; i < n; ++i) {
            if (a[i] > maxElem) {
                maxElem = a[i];
                canOperate = true;
            }
            if (i > 0 && a[i] != a[i - 1]) {
                operations++;
                canOperate = true;
            }
        }

        if (a[0] != a[n - 1] && canOperate) {
            operations++;
        }

        cout << operations << endl;
    }
    return 0;
}