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

typedef long long ll;

void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    int pos = -1;
    for (int i = 0; i < n; ++i)
    {
        if (s[i] != s[(i + 1) % n])
        {
            pos = i + 1;
            break;
        }
    }

    if (pos == -1)
    {
        cout << n / 2 << '\n';
        return;
    }

    int ans = 0, cnt = 1, flag = 0;
    for (int i = pos, k = 0; k < n; ++k, i = (i + 1) % n)
    {
        if (s[i] == s[(i + 1) % n])
            cnt++;
        else
        {
            if (!(cnt & 1))
                flag = 1;
            ans += cnt / 2;
            cnt = 1;
        }
    }
    ans += cnt / 2;
    cout << max(ans - flag, 0) << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}