#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;
        int last_pos = n - 1;

        // Start from the end of the array and look for the first non-uniform subarray
        while (last_pos > 0) {
            if (a[last_pos] != a[last_pos - 1]) {
                operations++;
                last_pos = last_pos - (n - last_pos);  // Move back to the length of the largest group found
            } else {
                last_pos--;
            }
        }

        cout << operations << endl;
    }

    return 0;
}