#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<queue>
#include<set> 
#include<stack>
#include<bitset>
#include<unordered_map>
#include<iomanip>
#include<cassert>
#define fi first
#define se second
#define endl '\n'
#define pb push_back
#define ep emplace_back 
#define debug(x) cout<<x<<'\n'
#define RES cout<<res<<'\n'
#define ANS cout<<ans<<'\n'
#define YES	cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define Yes	cout<<"Yes"<<'\n'
#define No cout<<"No"<<'\n'
#define me(a,x) memset(a,x,sizeof(a))
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define r23 cout<<233<<endl;return;
#define int long long 
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<PII,int> PIII;
typedef unsigned long long ull;
const int N=1e5+5,P=131,mod=998244353;
int qmi(int a,int b){
	int res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
int inv(int a,int b){
	return qmi(a,b-2);
}

void solve(){
	string s;cin>>s;
	int len=s.size();
	int st=-1;
	for(int i=0;i<len;i++){
		int j=(i+len-1)%len;
		if(s[i]!=s[j]){
			st=i;
			break;
		}
	}
	if(st==-1){
		cout<<len/2<<endl;
	}else{
		string ss=s.substr(st)+s.substr(0,st);
		int f=0,res=0,k=1;
		for(int i=1;ss[i];i++){
			if(ss[i]==ss[i-1]){
				k++;
			}else{
				if(k%2==0)f=1;
				res+=k/2;
				k=1;
			}
		}
		if(k%2==0)f=1;
		res+=k/2;
		cout<<res-f<<endl;
	}
}
//aaaaa   5-2 
//aaaaaa  6-3
//01234
//aabca
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
}