#include <bits/stdc++.h>
const int P = 998244353;
typedef long long ll;
#define rep(i, x, y) for (int i = (x); i <= (y); ++i)
using namespace std;
void solve()
{
    string s;
    cin >> s;
    int n = s.length();
    bool op = false;
    int cnt1 = 0;
    s = " " + s;
    string x;
    rep(i, 1, n)
    {
        int pos = i;
        while (pos <= n && s[pos] == s[i])
            pos++;
        int cnt = pos - i;
        if (cnt % 2 == 0 && (cnt >= 2))
        {
            cnt1 = i;
            break;
        }
        i = pos - 1;
    }
    if (cnt1)
    {
        x = s.substr(cnt1 + 1);
        x += s.substr(1, cnt1);
        x = " " + x;
    }
    else
        x = s;
    int ans = 0;
    rep(i, 1, n)
    {
        int pos = i;
        while (pos <= n && x[pos] == x[i])
            pos++;
        int cnt = pos - i;
        ans += cnt / 2;
        i = pos - 1;
    }
    cout << ans << endl;
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}
/*
3
abccbbbbd
abcde
x
*/