#include <bits/stdc++.h>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
#define SZ(x) ((int)(x).size())
using namespace std;
#define int long long
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
using ll = long long;
const int inf = 0x3f3f3f3f3f3f3f3fLL;

#define MULTI_TEST

void solve() {
    string str; cin >> str; int n = SZ(str); str = " " + str;

    int st = 1, ed = n;
    vector<int> Q;
    if(str[1] == str[n]) {
        char xx = str[1];
        
        while(str[st] == xx) {
            ++st;
        }

        while(str[ed] == xx) {
            --ed;
        }

        int len = st - 1 + n - ed;
        int tt = min(len, n) - 1;
        Q.push_back(tt);

        if(tt == n - 1) {
            cout << (tt + 1) / 2 << "\n";
            return ;
        }
    }



    int cnt = 0;
    for(int i = st; i <= ed; i++) {
        if(str[i] == str[i - 1]) {
            cnt++;
        } else {
            if(cnt) {
                Q.push_back(cnt);
            }
        }
    }

    int ans = 0, mx = 0; 
    for(auto v : Q) {
        ans += (v + 1) / 2;
        mx = max(mx, (v + 1) / 2 - v / 2);
    }
    cout << ans - mx << "\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
#ifdef MULTI_TEST
    int T; cin >> T;
#else
    int T = 1;
#endif
    while(T--) solve();
    return 0;
}

/*
3
abccbbbbd
abcde
x


1  
xxabcdxx

1
xxabcdxx


4
xxxax
xxxxa
xaxxx
xxaxx

2
xxxaxx
xxaxxx

2
xx
xxx

1
aaaaa

1
aaaaaa
*/