#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int T,n,siz[N],rt[N];
char s[N];
int root(int x) {
    if(rt[x]==x)return x;
    return rt[x]=root(rt[x]);
}
int main() {
    scanf("%d",&T);
    while(T--) {
        scanf("%s",s+1),n=strlen(s+1);
        for(int i=n+1;i<=n*2;i++)s[i]=s[i-n];
        for(int i=1;i<=n*2;i++)rt[i]=i,siz[i]=1;
        int ans,res=0;
        for(int i=1;i<=n;i++) {
            int tmp;
            if(s[i]==s[i-1])tmp=root(i-1),res-=(siz[tmp]/2),rt[tmp]=i,siz[i]+=siz[tmp],res+=(siz[i]/2);
        }ans=res;
        for(int i=1;i<n;i++) {
            int tmp,j=i+n;
            if(s[i]==s[i+1])tmp=root(i),res-=(siz[tmp]/2),siz[tmp]--,res+=(siz[tmp]/2);
            if(s[j]==s[j-1])tmp=root(j-1),res-=(siz[tmp]/2),rt[tmp]=j,siz[j]+=siz[tmp],res+=(siz[j]/2);
            ans=min(ans,res);
        }printf("%d\n",ans);
    }
}