#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<vector>
#include<bitset>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=5e5+5;
inline int read()
{
	int x=0,y=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') y=-1; c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*y;
}
int T,n,cnt=0;
char s[maxn];
int bel[5];
int main()
{
	T=read();
	while(T--)
	{
		cnt++;
		scanf("%s",s+1);
		n=strlen(s+1);
		bool flag=0;
		char pre='#'; int len=1,ans=0;
		s[n+1]='#';
		for(int i=1;i<=n+1;i++)
		{
			if(s[i]==pre) {len++; continue;}
			ans+=(len>>1);
			if(len%2==0&&s[1]!=s[n]) flag=1;
			else if(len%2==0&&i-len!=1&&i!=n+1) flag=1;
			if(i-len==1) bel[0]=len; else if(i==n+1) bel[1]=len;
			len=1; pre=s[i];
		}
		if(bel[0]==n) {printf("%d\n",ans); continue;}
		if(s[1]==s[n]) ans+=(bel[0]+bel[1])/2-bel[0]/2-bel[1]/2;
		if(flag) ans--; if(s[1]==s[n]&&(bel[0]+bel[1])%2==0) ans--;
		if(flag&&(s[1]==s[n]&&(bel[0]+bel[1])%2==0)) ans++;
		printf("%d\n",max(ans,0));
	}
	return 0;
}