#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

void solve() {
    std::string s;
    std::cin >> s;

    int cnt = 0, ok = false;
    while(s.size() and s.back() == s[0]) s.pop_back(), cnt += 1;
    int n = s.size();

    if(n == 0) {
        std::cout << cnt / 2 << '\n';
        return;
    }

    int ans = 0;
    for(int i = 0; i < n; i ++ ) {
        int j = i + 1;
        while(j < n and s[j] == s[i]) j ++;
        if(i == 0) {
            ans += (j - i + cnt) / 2;
            ok |= (j - i + cnt) % 2 == 0;
        } else {
            ans += (j - i) / 2;
            ok |= (j - i) % 2 == 0;
        }
        i = j - 1;
    }
    
    std::cout << ans - ok << '\n';

}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t = 1;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}