#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 last element and try to create the largest uniform subarray
        while (last_pos > 0) {
            int current = last_pos;
            // Find the largest uniform subarray starting from the last element
            while (current > 0 && a[current - 1] == a[last_pos]) {
                current--;
            }

            // If the current subarray isn't the entire array, we can perform an operation
            if (current > 0) {
                operations++;
                // Double the size of the uniform subarray by considering the previous non-uniform part
                last_pos = current - 1;
            } else {
                // If we have reached the beginning of the array, break
                break;
            }
        }

        cout << operations << endl;
    }

    return 0;
}