#include<iostream>
#include<cstdio>
#include<cstring>
#define I inline
using namespace std;

const int N = 1000100;
char s[N];
int lc[N],rc[N];
int n,ans;


I void solve() {
	scanf("%s",s+1); n=strlen(s+1); ans=0;
	for(int i=n+1;i<=n*2;++i) s[i]=s[i-n];
	int nr=n*2,nl=1;
	for(int i=n*2;i>=1;--i) {
		if(i!=n*2&&s[i]!=s[i+1]) {
			nr=i;
		}
		rc[i]=nr;
	}
	for(int i=1;i<=n*2;++i) {
		if(i!=1&&s[i]!=s[i-1]) {
			nl=i; 
		}
		lc[i]=nl;
	}
	//for(int i=1;i<=n*2;++i) cout<<lc[i]<<' '<<' '<<rc[i]<<endl;
	int r=0,l=1;
	for(int i=1;i<n;++i) {
		r++;
		if(lc[r]!=r) {
			ans-=(r-lc[r])/2;
			ans+=(r-lc[r]+1)/2;
		}
	}
	int fi=n;
	for(int i=1;i<=n;++i) {
		r++;
		int v=max(lc[r],i-1);
		if(v!=r) {
			ans-=(r-v)/2;
			ans+=(r-v+1)/2;
		}
		if(i!=1) {
			int nv=min(rc[i-1],r);
			if(nv!=i-1) {
				ans-=(nv-(i-1)+1)/2;
				ans+=(nv-(i-1))/2;
			} 
		}
		
		fi=min(fi,ans);
	}
	cout<<fi<<endl;
} 
int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0); cout.tie(0);
	int T; cin>>T;
	while(T--) {
		solve();
	} 
}