#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long N=1e6+10,mod=998244353,INF=1e15;
ll n,m,k,a[N];
bool st[N];
string s;
int q[N],l,r;
void solve()
{
	cin>>s;
	n=s.size();
	s=s+s;
	s=" "+s;
	l=1,r=1;
	int cnt=0,res=0;;
	int ans=1e9;
	//cout<<s<<endl;
	for(int i=1;i<=2*n;i++)
	{
		if(i<=n)
		{
		if(i==1||s[i]==s[i-1])
		{
			res-=cnt/2;
			res+=(cnt+1)/2;
			q[r]=cnt+1;
			cnt++;
		}
		else{
			q[++r]=1;
			cnt=1;
		}
		}
		else{
			int ll=i-n+1;
			if(s[i]==s[i-1])
			{
				res-=cnt/2;
				res+=(cnt+1)/2;
				q[r]=cnt+1;
				cnt++;
			}
			else{
				q[++r]=1;
				cnt=1;
			}
			if(s[ll]==s[ll-1])
			{
				res-=q[l]/2;
				res+=(q[l]-1)/2;
				q[l]--;
			}
			else l++;
		}
		if(i>=n)
		{
			ans=min(ans,res);
		}
	}
	cout<<ans<<endl;
}
signed main()
{
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
    int T;cin>>T;
    while(T--)solve();
    return 0;
}