#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

void solve() {
	string s;
	cin >> s;

	int n = s.size();

	if (count(s.begin(), s.end(), s[0]) == n) {
		cout << n / 2 << "\n";
		return;
	}

	if (s[0] == s[n - 1]) {
		string t;
		int i = n - 1;
		while (i >= 0 && s[i] == s[0]) {
			t += s[i];
			i--;
		}
		t += s.substr(0, i + 1);
		s = t;
	}

	vector<int> f(n);
	int tot = 0;
	for (int i = 0, j = 0; i <= n; i++) {
		if (i == n || s[i] != s[j]) {
			tot += (i - j) / 2;
			while (j < i) {
				f[j] = i - j;
				j++;
			}
		}
	}

	int ans = tot;
	for (int i = 0; i < n; i++) {
		int res = tot - f[i] / 2;
		for (int j = 1; j < f[i]; j++) {
			ans = min(ans, res + j / 2 + ((f[i] - j) / 2));
		}
		i = i + f[i] - 1;
	}
	cout << ans << "\n";
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t;
	cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}