// Problem: I. Left Shifting 2
// Contest: Codeforces - The 2024 ICPC Kunming Invitational Contest
// URL: https://codeforces.com/gym/105386/problem/I
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

/*
   /\__/\
  (o    o)
  /      \
 // ^  ^ \\
///      \\\
  \      /
   \____/
  /\_  _/\
 */
#include<bits/stdc++.h>

#define fir first
#define sec second
#define pb push_back
#define lowbit(X) X&(-X)
#define sz(X) (int)(X).size()
#define all(X) (X).begin(),(X).end()

#define YES cout<<"YES"<<'\n'
#define Yes cout<<"Yes"<<'\n'
#define NO cout<<"NO"<<'\n'
#define No cout<<"No"<<'\n'
#define error cout<<"-1"<<'\n'

using namespace std;
typedef long long unt;
typedef long double ld;
typedef vector<int> vt_int;
typedef vector<char> vt_char;
typedef vector<bool> vt_bool;
typedef vector<long long> vt_unt;
typedef vector<long double> vt_ld;
typedef vector<vector<int> > vvt_int;
typedef vector<vector<char> > vvt_char;
typedef vector<vector<bool> > vvt_bool;
typedef vector<vector<long long> > vvt_unt;
typedef vector<vector<long double> > vvt_ld;

const long long mod=1e9+7;
const long long INF=1152921504606846976;//(2^60)
const long long N=110000;

int solve(){
    string s;
    cin>>s;
    int n=s.size();
	set<char>S;
	for(auto e:s){
		S.insert(e);
	}
	if(sz(S)==1){
		cout<<n/2<<endl;
		return 0;
	}
	deque<char>a;
	for(auto e:s){
		a.push_back(e);
	}
	while(a.front()==a.back()){
		int x=a.front();
		a.pop_front();
		a.push_back(x);
		//ans++;
	}
	
	// for(int i=0;i<n;i++){
		// cout<<a[i]<<" ";
	// }
	// cout<<endl;
	
	for(int i=0;i<n;i++){
		int cnt=1;
		while(i+1<n&&a[i+1]==a[i]){
			cnt++;
			i++;
		}
		//cout<<i<<" "<<cnt<<endl;
		if(cnt%2==0){
			int k=i;
			while(k--){
				int x=a.front();
				a.pop_front();
				a.push_back(x);
			}
			//ans+=i-(cnt/2)+1;
			break;
		}
	}
	
	// for(int i=0;i<n;i++){
		// cout<<a[i]<<" ";
	// }
	// cout<<endl;
	
	int ans=0;
	for(int i=0;i<n;i++){
		int cnt=1;
		while(i+1<n&&a[i+1]==a[i]){
			cnt++;
			i++;
		}
		//cout<<i<<" "<<cnt<<endl;
		ans+=(cnt/2);
	}
	cout<<ans<<endl;
    return 0;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int testcase;
    testcase=1;
    cin>>testcase;
    while(testcase--){
        int flag=solve();
        
        if(flag==1) YES;
        if(flag==-1) NO;
    }
    return 0;
}