#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i = a; i < n; i++)
#define per(i,a,n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
const ll mod = 1000000007;
// head

typedef vector<pii> vp;
string s;

int f(int x) {
	if (x == 1) return 0;
	else if (x == 2) return 1;
	return (x / 2);
}

void solve() {
	cin >> s;
	vp l; ll ans = 0;
	for (int i = 0, j = 0; i < SZ(s); i++) {
		j = i;
		while (s[i] == s[j] and j < SZ(s)) j++;
		l.eb(j - i, s[i] - 'a'), ans += f(j - i);	
		i = j - 1;
	}
	if (SZ(l) == 1) {
		cout << ans << endl;
		return;
	}
	// cerr << ans << endl;
	ll ret = ans;
	for (int i = 0; i < SZ(l); i++) {
		int id = (i + SZ(l) - 1) % SZ(l);
		if (l[id].se == l[i].se) {
			if (l[id].fi % 2 == 0 and l[i].fi % 2 == 0) {
				ret = min(ret, ans - 1);
			}
		} else {
			if (l[id].fi % 2 == 0) {
				ret = min(ret, ans - 1);
			}
		}
	}
	cout << ret << endl;
}

int tc;
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);

	cin >> tc;
	while (tc -- ) solve();
}