#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve()
{
    string s;cin>>s;
    int len=s.size()-1;
    if(s[0]==s[len])
    {
        int flag=0;
        for(int i=1;i<=len;i++)
            if(s[i]!=s[i-1]){flag=1;break;}
        if(!flag)
        {
            len++;
            if(len%2) {cout<<(len-1)/2<<endl;return;}
            else {cout<<len/2<<endl;return;}
        }
        int num=2;
        int l,r;
        for(int i=1;i<len;i++)
            if(s[i]==s[i-1]) num++;
            else {l=i;break;}
        for(int i=len-1;i>0;i--)
            if(s[i]==s[i+1]) num++;
            else {r=i;break;}
        flag=0;
        int cnt=0,ans=0;
        for(int i=l;i<=r;i++)
        {
            while(s[i]==s[i+1] && i+1<=r)
            {
                cnt++;
                i++;
            }
            cnt++;
            if(cnt%2) ans+=(cnt-1)/2;
            else ans+=cnt/2,flag=1;
            cnt=0;
        }
        if(num%2==0)
        {
            ans+=(num-1)/2;
            cout<<ans<<endl;
            return;
        }
        else
        {
            ans+=(num-1)/2;
            if(flag) ans--;
            cout<<ans<<endl;
        }
        return;
    }
    int flag=0,cnt=0,ans=0;
    for(int i=0;i<=len;i++)
    {
        while(s[i]==s[i+1] && i+1<=len)
        {
            cnt++;
            i++;
        }
        cnt++;
        if(cnt%2) ans+=(cnt-1)/2;
        else ans+=cnt/2,flag=1;
        cnt=0;
    }
    if(flag) ans--;
    cout<<ans<<endl;
}
signed main()
{   
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}