#include<bits/stdc++.h>
#define i64 long long
#define int i64
using PII = std::pair<int,int>;
using TIII = std::tuple<int,int,int>;
constexpr int mod = 1e9+7;
constexpr int inf = 1e9+5;
int n,m,k;

void solve()
{
    std::string s;
    std::cin >> s;
    n = s.size();
    s = " " + s;

    int ans = 0;
    int left = 0, right = 0;
    bool ok = false;

    if(s[1] == s[n])
    {
        for(int i = 1;i <= n;i ++)
        {
            if(s[i] == s[1])
                left ++;
            else
                break;
        }
        for(int i = n;i >= 1;i --)
        {
            if(s[i] == s[n])
                right ++;
            else
                break;
        }
        if(left == n)
        {
            std::cout << left / 2 << "\n";
            return ;
        }
        ans += (left / 2 + right / 2);
    }

    int l = left + 1, r = n - right;

    int now = 1, last = s[l];
    for(int i = l + 1;i <= r;i ++)
    {
        if(s[i] != last)
        {
            if(now % 2 == 0) ok = true;
            ans += now / 2, now = 1, last = s[i];
        }
        else
            now ++;
    }

    if(now % 2 == 0) ok = true;
    ans += now / 2;

    // 左右一奇数一偶数不影响。
    if(s[1] == s[n])
    {
        if((left & 1) and (right & 1))
            ok = false;
        else if(left % 2 == 0 and right % 2 == 0)
            ok = true;
    }

    std::cout << (ok ? std::max(ans - 1, 0ll) : ans) << "\n";
}

signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int T=1;
    std::cin >> T;
    while(T--)
    {
        solve();
    }
    return  0;
}