#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
using ll = long long;
using i64 = long long;
const int mod = 998244353;
// #define DEBUG

// 线段树合并信息

void solve() {
    std::string s;std::cin>>s;
    int n = s.size();
    std::string tp = s + s;
    int now = 0;
    while(now < n && tp[now] == tp[now + n - 1]) now++;
    if(now == n){
        std::cout<<(n) / 2<<'\n';
        return;
    }
    s = tp.substr(now, n);
    //std::cerr<<s<<'\n';
    int ans = 0;
    int flg = 0;
    for(int i = 0;i < n;i++){
        int cnt = 1;
        while(i + 1 < n && s[i] == s[i + 1]){
            cnt++;
            i++;
        }
        ans += cnt / 2;
        if(cnt % 2 == 0) flg = 1;
    }
    if(flg) ans--;
    std::cout<<ans<<'\n';
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int t = 1;
    // int res = 0;
    // for(int i = 1;i <= 1145;i++) res |= i;
    // std::cerr<<res<<'\n';
    std::cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}