#include <bits/stdc++.h>

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

typedef std::pair<long long, long long> PII;
const int mod = 998244353;
const int N = 2e6 + 1000;
const int INF = 0x3f3f3f3f;
const long long LINF = 1e18;
const double eps = 1e-12;
const double pi = std::acos(-1);
std::mt19937_64 rnd(std::random_device{}());

void solve() {
    std::string s;
    std::cin >> s;
    int n = s.size();

    std::set<int> mp;
    for (auto c : s) mp.insert(c);
    if (mp.size() == 1) {
        std::cout << n / 2 << "\n";
        return ;
    }

    char ch = s.front();
    for (int i = 1; i < n; i ++) if (s[i] != ch) {
        std::rotate(s.begin(), s.begin() + i, s.end());
        break;
    }

    int ans = 0, ok = 0;
    for (int l = 0, r; l < n; l = r + 1) {
        r = l;
        while (r + 1 < n && s[r + 1] == s[l]) r ++;
        if (r - l + 1 > 1 && (r - l + 1) % 2 == 0) ok = 1;
        ans += (r - l + 1) / 2;
    }

    std::cout << ans - ok << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
    
    int tmp = 1;
    
    std::cin >> tmp;

    while (tmp--)
        solve();

    return 0;
}