#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    int tar = -1;
    for (int i = 0; i < n; ++i)
    {
        if (s[i] != s[(i + 1) % n]) tar = i + 1;
    }
    if (tar == -1)
    {
        cout << n / 2 << '\n';
        return;
    }
    int cur = 0;
    vector<int> v;
    for (int i = tar; i < tar + n; ++i)
    {
        if (s[i % n] == s[(i + 1) % n]) cur++;
        else v.push_back(cur), cur = 0;
    }
    int ans = 0, f = 0;
    for (auto e : v)
    {
        if (e % 2) f = 1;
        ans += (e + 1) / 2;
    }
    cout << ans - f << '\n';
    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}