#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(), (x).end()
const int dir[][2] = {1, 0, -1, 0, 0, 1, 0, -1};

int get(int x)
{
    return x / 2;
}
void solve()
{
    deque<pair<char, int>> dq;

    string s;
    cin >> s;
    int n = s.size();
    s += s;
    int l = 0, r = n - 1;
    char last = 0;
    int cnt = 0;
    int ans = 0;

    for (int i = l; i < r; ++i) {
        if (!last) {
            last = s[i];
            cnt = 1;
        }
        else if (s[i] == last)
            cnt++;
        else {
            dq.emplace_back(last, cnt);
            ans += get(cnt);
            cnt = 1;
            last = s[i];
        }
    }
    dq.emplace_back(last, cnt);
    ans += get(cnt);
    cnt = 0;
    int mi = ans;
    l++;
    while (l < n) {
        char st = dq.front().first;
        ans -= get(dq.front().second);
        dq.front().second--;
        if (!dq.front().second)
            dq.pop_front();
        else
            ans += get(dq.front().second);

        char ed = dq.back().first;
        if (ed == st) {
            ans -= get(dq.back().second);
            dq.back().second++;
            ans += get(dq.back().second);
        }
        else
            dq.emplace_back(st, 1);

        mi = min(mi, ans);
        l++;
    }

    cout << mi << '\n';
}

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

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