#include <bits/stdc++.h>
#define mkp make_pair
#define fi first
#define se second
#define debug(x) cerr<<"line: "<<__LINE__<<" with "<<x<<"\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using vi = vector<int>;
const int mod = 998244353;
template<class T>bool chkMin(T &x,T y){if(x>y)return x=y,true;return false;}
template<class T>bool chkMax(T &x,T y){if(x<y)return x=y,true;return false;}
template<class T>void moder(T &x){x%=mod;}
const int MAXN = 500005;
string s;
int n;
void solve(){
	cin>>s; n=s.length(); s=" "+s;
	vector<int> v;
	char tag = s[1];
	int L=1,R=n;
	bool f=0;
	for(int i=1;i<=n;i++){
		if(s[i]!=tag)f=1;
	}
	if(!f){
		//all the same
		cout<<n/2<<"\n";
		return;
	}
	int cnt = 0;
	while(L<=n && s[L]==tag)L++,cnt++;
	while(R>=L && s[R]==tag)R--,cnt++;
	v.push_back(cnt);
	for(int i=L;i<=R;){
		int r=i;
		while(r<=R && s[r]==s[i])r++;
		v.push_back(r-i);
		i=r;
	}
	int ans = 0;
	f=0;
	for(int i : v){
		ans += i/2;
		if(i%2==0)f=1;
	}
	cout<<ans-f<<"\n";
}
signed main() {
	//cerr<<(&s1-&s2)/1024.0/1024<<" ";
	cin.tie(nullptr)->sync_with_stdio(false);
	int T;cin>>T;
	while(T--)solve();
	return 0;
}