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

#define int long long
const int M = 998244353;
int modpow(int n, int k) {
	int ans = 1;
	while (k) {
		if (k % 2) ans = (ans*n) % M;
		n = (n*n) % M; k /= 2;
	}
	return ans;
}

void solve() {
	string s; cin >> s;
	int ans = 0;
	for (int i = 1; i < s.size(); i++) {
		if (s[i] == s[i-1]) ans++;
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

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

	return 0;
}