#include <bits/stdc++.h>
// #define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define bit(x, y) ((x) >> (y)) & 1
#define pb push_back
#define ll long long
#define ii pair<int, int>
#define f first
#define s second
#define M 1000000007
using namespace std;
const int N = 1e6 + 5;
void Inp()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(".inp", "r"))
    {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }
}
int R[N], F[N];
void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    s = '*' + s + s;
    FOD(i, 2 * n, 1) {
        if (i < 2 * n && s[i] == s[i + 1]) R[i] = R[i + 1] + 1;
        else R[i] = 1;
    }
    int ans = 1e9;
    FOR(i, 1, 2 * n) {
        F[i] = F[i - 1];
        if (i > 1 && s[i] == s[i - 1]) {
            ++F[i];
            s[i] = '*';
        }
        if (i >= n) {
            int x = F[i] - F[i - n];
            if (s[i - n + 1] == '*') {
                int y = min(R[i - n + 1], n);
                if (y & 1) --x;
            }
            ans = min(ans, x);
        }
    }
    cout << ans << '\n';
}
signed main()
{
    Inp();
    int Case = 1;
    cin >> Case;
    while (Case--)
        solve();
    return 0;
}