#include<bits/stdc++.h>

using namespace std;

#define int long long

void solve(){
	string s;
	cin >> s;
	int n = s.size();
	bool vis[n] = {};
	int ans = 0;
	bool f = 1;
	for (int i = 0;i < n;i ++){
		if (vis[i]) continue;
		queue<int> que;
		vis[i] = 1;
		que.push(i);
		int cnt = 1;
		while(!que.empty()){
			int u = que.front();
			que.pop();
			if (u != 0 && !vis[u - 1] && s[u - 1] == s[u]){
				cnt ++;
				vis[u - 1] = 1;
				que.push(u - 1);
			}
			if (u != n - 1 && !vis[u + 1] && s[u + 1] == s[u]){
				cnt ++;
				vis[u + 1] = 1;
				que.push(u + 1);
			}
			if (u == 0 && vis[n - 1] == 0 && s[n - 1] == s[0]){
				cnt ++;
				vis[n - 1] = 1;
				que.push(n - 1);
			}
		}
		if (cnt == n){
			cout << n / 2 << "\n";
			return;
		}
		if (cnt % 2 == 0 && f){
			ans += cnt / 2 - 1;
			f = 0;
		}
		else ans += cnt / 2;
	}
	cout << ans << "\n";
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t = 1;
	cin >> t;
	while(t --){
		solve();
	}
}