#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
// #define int long long
typedef long long LL;

inline int read(){
	int x = 0 , f = 1 ; char c = getchar() ;
    while( c < '0' || c > '9' ) { if( c == '-' ) f = -1 ; c = getchar() ; } 
    while( c >= '0' && c <= '9' ) { x = x * 10 + c - '0' ; c = getchar() ; } 
    return x * f ;
}

const int maxn = 1e6+20;
int n;
int ans = 0;
int cnt[2][maxn];
char S[maxn];

void solve(){
    scanf("%s",S+1);
    n = strlen(S+1);
    for(int i=1;i<=n;i++) S[i+n] = S[i];
    // printf("%s\n",S+1);
    for(int i=2;i<=2*n;i++){
        cnt[1][i] = cnt[1][i-1];
        if(S[i]==S[i-1]){
            cnt[1][i]++;
            i++;
            cnt[1][i] = cnt[1][i-1];
        }
    }
    for(int i=3;i<=2*n;i++){
        cnt[0][i] = cnt[0][i-1];
        if(S[i]==S[i-1]){
            cnt[0][i]++;
            i++;
            cnt[0][i] = cnt[0][i-1];
        }
    }
    int ans = n;
    // cout<<cnt[0][6+n-1]<<' '<<cnt[0][6]<<endl;
    for(int i=1;i+n-1<=2*n;i+=2) ans = min(ans,cnt[1][i+n-1] - cnt[1][i]);
    for(int i=2;i+n-1<=2*n;i+=2) ans = min(ans,cnt[0][i+n-1] - cnt[0][i]);
    printf("%d\n",ans);
}

signed main(){
	// freopen("1.txt","r",stdin);
	int T = 1;
	T = read();
	while(T--) solve();
	return 0;
}