#include <iostream>
#include <vector>
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];
        }
        
        // Count transitions
        int operations = 0;
        for (int i = 1; i < n; ++i) {
            if (a[i] != a[i - 1]) {
                operations += 1;
            }
        }
        
        // Output the maximum number of operations
        cout << operations << endl;
    }
    
    return 0;
}