#include<bits/stdc++.h>
const int P = 998244353;
typedef long long ll;
#define rep(i,x,y) for (int i=(x);i<=(y);++i)
using namespace std;
void solve() {
	string s;
	cin >> s;
	int n = s.length();
	bool op = false;
	int l = 0;
	int r = n - 1;
	while (l < n && s[l] == s[0]) l++;
	while (r >= 0 && s[r] == s[n - 1]) r--;
	l--;
	r++;
	int ans = 0;
	if (s[0] == s[n - 1] && l < r) {
		int lenl = l + 1;
		int lenr = n - r;
		int cnt1 = (lenl + lenr) / 2;
		int cnt2 = lenl / 2 + lenr / 2;
		ans = cnt2;
		op = true;
	} else if (s[0] == s[n - 1] && l >= r) {
		cout << n / 2 << '\n';
		return;
	}
	if (s[0] == s[n - 1]) {
		rep(i, l + 1, r - 1) {
			int pos = i;
			while (pos < n && s[pos] == s[i]) pos++;
			int cnt = pos - i;
			ans += cnt / 2;
			i = pos - 1;
		}
	} else {
		rep(i, 0, n - 1) {
			int pos = i;
			while (pos < n && s[pos] == s[i]) pos++;
			int cnt = pos - i;
			if (cnt % 2 == 0 && (cnt >= 2)) {
				if (!op) {
					ans += (cnt - 2) / 2;
					op = true;
				} else {
					ans += cnt / 2;
				}
			} else if (cnt % 2) {
				ans += cnt / 2;
			}
			i = pos - 1;
		}
	}
	cout << ans << '\n';
	return;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	cin >> t;
	while (t--) solve();
	return 0;
}
/*
3
abccbbbbd
abcde
x
*/