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

#define ll long long 
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>

#define N 100010
#define K 20

int val(pii x) {
    return (x.second - x.first) / 2;
}

pii intersect(pii x, pii y) {
    auto res = pii(max(x.first, y.first), min(x.second, y.second));
    assert(res.second > res.first);
    return pii(max(x.first, y.first), min(x.second, y.second));
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        string s; cin >> s;
        int n = s.length();

        s += s;
        int m = 2 * n;

        vector<pii> it;
        for (int i = 0, j = 0; i < m; ++ i) {
            while (j <= i || (j < m && s[i] == s[j])) ++ j;
            if (j - i > 1) it.emplace_back(i, j);
            i = j - 1;
        }

        int op = 0;

        int mn = INF;

        for (int i = 0, l = 0, r = 0; i < n; ++ i) {
            int j = i + n;
            while (r < it.size() && it[r].first < j) op += val(it[r ++]);
            while (l < it.size() && it[l].second <= i) op -= val(it[l ++]);

            int cur = INF;
     
            if (l >= r) {
                cur = 0;
            } else if (r - l == 1) {
                cur = val(intersect(it[l], pii(i, j)));
            } else {
                cur = op - val(it[l]) - val(it[r-1]);
                cur += val(intersect(it[l], pii(i, j)));
                cur += val(intersect(it[r-1], pii(i, j)));
            }

            mn = min(mn, cur);
        }

        cout << mn << '\n';
    }
}