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

void solve()
{
    string S;
    cin >> S;
    if(S.size() == 2 && S[1] == S[0]) {
        cout << 1 << '\n';
        return;
    }
    int f = 0, ans = 0, cnt = 1, up = 0;
    for(int i = 1; i < S.size(); i++) {
        if(S[i] == S[i - 1]) cnt++;
        else {
            if(!up) up = cnt;
            ans += cnt / 2;
            if(cnt % 2 == 0) f = 1;
            cnt = 1;
        }
    }

    if(cnt % 2 == 0) f = 1;
    ans += cnt / 2;
    if(S.back() == S[0]) {
        if(cnt % 2 == 0 && up % 2 == 0) f = 1;
        else f = 0;
    }

    cout << ans - f << '\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}