#include<iostream>
#include<vector>
using namespace std;

const int N = 1e6 + 10;

int sum[N], r[N];

void solve() {
	string s;
	cin >> s;
	int n = s.size();
	s = s + s;
	s = ' ' + s;
	int cnt=0;
	int last = 1;
	for (int i = 1; i <= 2 * n; i++) sum[i] = 0, r[i] = 0;

	for (int i = 2; i <= n*2; i++)
	{
		if (s[i] == s[i - 1])
		{
			cnt -= last / 2;
			last++;
			cnt += last / 2;
		}
		else
		{
			last = 1;
		}
		sum[i] = cnt;
	}
	// for (int i = 1; i <= 2 * n; i++) cout << sum[i] << "\n";
	int ans = n;
	r[n * 2] = n * 2;
	for (int i = n * 2-1; i >= 1; i--)
	{
		if (s[i] == s[i + 1]) r[i] = r[i + 1];
		else r[i] = i;
	}
	for (int i = n; i <= 2 * n; i++)
	{
		int l = i - n + 1;
		int t = r[l] - l + 1;
		int ss = t / 2;
		if (t >= n)
		{
			ss = n / 2;
		}
		else ss += sum[i] - sum[r[l]];
		// cout << sum[i] << " " << sum[r[l]] << " ";
		// cout << t << " ";
		// cout << ss << "\n";
		ans = min(ans, ss);
	}
	// cout << cnt << "\n";
	cout << ans << "\n";
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	while (T--) solve();
	return 0;
}