#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
ll rd(){
	ll x=0,f=1;char c=getchar();
	while(!isdigit(c)){
		if(c=='-')f=-1;
		c=getchar();
	}while(isdigit(c)){
		x=x*10+c-'0';
		c=getchar();
	}return x*f;
}
#define d rd()
ll T,n;
char c[500010];
ll f[2][500010];
ll g[2][500010];
int main(){
    T=d;while(T--){
        scanf("%s",c+1);
        n=strlen(c+1);
        f[0][1]=0,f[1][1]=1;
        ll t=1;f(i,2,n){
            f[0][i]=f[0][i-1];
            if(c[i]==c[i-1])t++;else t=1;
            if(t%2==0)f[0][i]++;
        }t=0;f(i,2,n){
            f[1][i]=f[1][i-1];
            if(c[i]==c[i-1])t++;else t=1;
            if(t%2==0)f[1][i]++;
        }reverse(c+1,c+n+1);
        g[0][1]=0,g[1][1]=1;
        t=1;f(i,2,n){
            g[0][i]=g[0][i-1];
            if(c[i]==c[i-1])t++;else t=1;
            if(t%2==0)g[0][i]++;
        }t=0;f(i,2,n){
            g[1][i]=g[1][i-1];
            if(c[i]==c[i-1])t++;else t=1;
            if(t%2==0)g[1][i]++;
        }ll res=f[0][n];
        f(i,1,n){
            if(c[1]!=c[n])res=min(res,min(f[0][n-i],f[1][n-i])+min(g[0][i],g[1][i]));
            else res=min(res,min(f[0][n-i]+g[1][i],f[1][n-i]+g[0][i]));
        }cout<<res<<endl;
    }
	return 0;
}