#include<bits/stdc++.h>
using namespace std;

const int N=1e6+100,INF=1e9;
#define gc getchar()
#define rd read()
inline int read(){
	int x=0,f=0; char c=gc;
	for(;c<'0'||c>'9';c=gc) f|=(c=='-');
	for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

int n,ans=0,mn=INF; char s[N];
int pre[N],nxt[N];

void solve(){
	scanf("%s", s+1),n=strlen(s+1),ans=0,mn=INF;
	for(int i=1;i<=n;++i) s[i+n]=s[i];
	for(int i=1,j;i<=2*n;i=j) for(j=i;j<=2*n&&s[j]==s[i];++j) pre[j]=i;
	for(int i=2*n,j;i;i=j) for(j=i;j&&s[j]==s[i];--j) nxt[j]=i;
	
	for(int i=1;i<=n;i=nxt[i]+1) ans+=(min(nxt[i],n)-i+1)/2; mn=min(mn,ans);
	for(int i=2;i+n-1<2*n;++i){
		if(s[i-1]==s[i]) ans-=(min(nxt[i-1],i-1+n-1)-(i-1)+1)/2,ans+=(min(nxt[i],i-1+n-1)-i+1)/2;
		if(s[i+n-2]==s[i+n-1]) ans-=(i+n-2-max(pre[i+n-2],i)+1)/2,ans+=(i+n-1-max(pre[i+n-1],i)+1)/2;
		mn=min(mn,ans);
	}
	printf("%d\n", mn);
}

int main(){
	
	int T=rd;
	while(T--) solve();
	
	return 0;
}