#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define all(a) a.begin(),a.end()
typedef pair<int,int> PII;
typedef long long LL;
const int N = 1e6;
const int mod = 998244353;
inline int ls(int x) { return x << 1; }
inline int rs(int x) { return x << 1 | 1; }
int dx[8] = { 1,0,0,-1,-1,-1,1,1 };
int dy[8] = { 0,-1,1,0,-1,1,-1,1};
inline int gcd(int a, int b)
{
   if (b) while ((a %= b) && (b %= a));
   return a + b;
}
void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    s = s + s;
    vector<int>suf(n),pre(n);
    for(int i = 0;i < n;i++) suf[i] = pre[i] = i;
    int sum = 0;
    set<int>st;
    for(int i = 0;i < n;){
        int j = i;
        while(j < n && s[j] == s[i]){
            j++;
        }
        sum += (j - i) / 2;
        for(int k = i;k < j;k++){
            suf[k] = j - 1;
            pre[k] = i;
        }
        i = j;
        st.insert(s[i] - 'a');
    }
    if(st.size() == 1){
        cout << sum << endl;
        return;
    }
    int ans = sum;
    for(int i = 0;i <= suf[0];i++){
        int res = sum;
        int cnt = suf[0] + 1;
        res -= cnt / 2;
        res += (suf[i] - i) / 2;
        if(s[0] == s[n - 1]){
            int r = n - pre[n - 1];
            res -= r / 2;
            res += (i + 1 + r) / 2;
        }
        else res += (i + 1) / 2;
        // cerr << i << ' ' << res << endl;
        ans = min(ans,res);
    }
    int tmp = 0;
    if(s[0] == s[n - 1]){
        int l = suf[0] + 1;
        int r = n - pre[n - 1];
        tmp += (l + r) / 2 - l / 2 - r / 2;
    }
    for(int i = suf[0] + 1;i < pre[n - 1];i++){
        int res = sum;
        int cnt = (suf[i] - pre[i] + 1);
        res -= cnt / 2;
        res += (i - pre[i] + 1) / 2 + (suf[i] - i) / 2;
        if(s[0] == s[n - 1]) res += tmp;
        // cerr << i << ' ' << res << endl;
        ans = min(res,ans);
    }
    for(int i = pre[n - 1];i < n - 1;i++){
        int res = sum;
        int cnt = n - pre[n - 1];
        res -= cnt / 2;
        res += (i - pre[i] + 1) / 2;
        if(s[0] == s[n - 1]){
            int l = suf[0] + 1;
            res -= l / 2;
            res += (n - 1 - i + l) / 2;
            // cerr << l << ' ' << n - i << ' ';
        }
        else res += (n - i - 1) / 2;
        // cerr << i << ' ' << res << endl;
        ans = min(ans,res);
    }
    cout << ans << endl;
}
signed main()
{
    io;
    int tt = 1;
    cin >> tt;
    while(tt--)
    {
        solve();
    }
	return 0;
}
/*
 3
 abccbbbbd
 abcde
 x
*/