#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
typedef vector<vector<ll>> Mat;
const int N=1e6+10,mod=1e9+7,inf=1e9+1,P=998244353;
const double pi=acos(-1.0),esp=1e-9;
const ll INF=1e18;
deque<int>q;
int ans=0;
void add(){
	int x=q.back();
	q.pop_back();
	if(x%2)ans++;
	q.push_back(x+1);
}
void del(){
	int x=q.front();
	q.pop_front();
	if(x%2==0)ans--;
	if(x>1)
	q.push_front(x-1);
}
void solve()
{
	string s;
	cin>>s;
	int n=s.size();
	//cout<<s<<'\n';
	s=" "+s+s;
	q.clear();
	int mi=inf;
	ans=0;
	for(int i=1;i<=n;i++){
		if(s[i]!=s[i-1])
		q.push_back(1);
		else
		add();
	}
	mi=ans;
	for(int i=n+1;i<=n*2;i++){
		if(s[i]!=s[i-1])
		q.push_back(1);
		else
		add();
		del();
		mi=min(mi,ans);
	}
	cout<<mi<<'\n';
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
        solve();
    return 0;
}