#include <bits/stdc++.h>
using namespace std;
int bian(int x)
{
    if(x==1) return 0;
	if(x%2==0) return x/2;
	return (x-1)/2;	
}
int main()
{
	int t;scanf("%d\n",&t);
	while(t--)
	{
		int ans=0;
		string s;cin>>s;
		map <char,int> ma;
		int n=s.size();
		for(int i=0;i<n;i++) ma[s[i]]++;
		if(ma.size()==1){cout<<bian(n)<<'\n';continue;}
		bool f=0;
		s=s+'M';
		int tou=0,wei=0; 
		for(int i=0,j=0;i<=n;i++)
		{
			while(s[i]==s[j]&&j<=n){j++;}
			int len=j-i;
			if(i==0) {tou=len;goto out;}
			if(j==n) {wei=len;goto out;}
			ans+=bian(len);
			if(len%2==0) f=1;
			out:
			i=j-1;
		}
		if(s[0]==s[n-1])
		{
			ans+=bian(tou+wei);
			if((tou+wei)%2==0) f=1;
		}
		else
		{
			ans+=bian(tou)+bian(wei);
			if(tou%2==0||wei%2==0) f=1;
		}
		cout<<ans-f<<'\n';
	}   // bbabb
	return 0;
}