Broken Telephone

#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n; cin >> n;
    vector<int> a(n); for (int &i: a) cin >> i;
    int ans = 0;
    for (int i = 1; i < n - 1; ++i) {
        if (a[i] != a[i - 1] || a[i] != a[i + 1]) ans++;
    }
    if (a[n - 1] != a[n - 2]) ans++;
    if (a[0] != a[1]) ans++;
    cout << ans << '\n';
}

int main() {
    int t; cin >> t;
    while (t--) solve();
    return 0;
}