#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{

    string s;cin>>s;
    int n=s.size();
    s+=s;
    deque<pair<char,int>>q;
    for(int i=0;i<n;i++)
    {
        char c=s[i];
        if(q.empty() or q.back().first!=c)
        {
            q.push_back({c,1});
        }
        else
        {
            q.back().second++;
        }
    }
    int ans=0,cur=0;
    for(auto p:q)
    {
        cur+=(p.second/2);
    }
    ans=cur;
    for(int i=n;i<n*2;i++)
    {
        char c=s[i];
        int bk=q.back().second/2;
        if(q.back().first!=c)
        {
            q.push_back({c,1});
        }
        else
        {
            q.back().second++;
            int bk2=q.back().second/2;
            cur+=bk2-bk;
        }

        bk=q.front().second/2;
        q.front().second--;
        int bk2=q.front().second/2;
        cur-=bk-bk2;

        if(q.front().second==0)
        {
            q.pop_front();
        }

        ans=min(ans,cur);        
    }
    cout<<ans<<endl;
}
int32_t main()
{
    int t;cin>>t;
    while(t--)
    {
        solve();
    }
}