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

typedef long long int ll;
//#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define TEXT freopen("azerah.in","r",stdin); freopen("azerah.out","w",stdout);
#define testcase int TT; cin >> TT; for (int tc = 1; tc <= TT; tc++)
#define POL(i,n) for (int i = 0 ; i < n ; ++i)
#define pb push_back
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define F first
#define S second
//#define endl "\n"
typedef pair<int,int>PL;



void solve()
{
    string s;
    cin >> s;
    int n=s.size();
    s=' '+s;
    int l=1,r=n,cnt=0;
    vector<int>v;

    for(int i=1;i<=n;i++)
    {
        if(s[i]==s[1])
        {
            l=i+1;cnt++;
        }
        else break;
    }

    if(l==n+1)
    {
        cout << n/2 << endl;
        return;
    }
    for(int i=n;i>=l;i--)
    {
        if(s[i]==s[1])
        {
            r=i-1;cnt++;
        }
        else break;
    }

    v.pb(cnt);

    int c=1,f=0,ans=0;
    for(int i=l+1;i<=r;i++)
    {
        if(s[i]==s[i-1])
        {
            c++;
        }
        else
        {
            v.pb(c);
            c=1;
        }
    }
    v.pb(c);
    for(auto it:v)
    {
        ans+=(it/2);
        if((it%2)==0)f=1;
    }
    cout << ans-f << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    testcase
    {
        solve();
    }

    return 0;
}