#include<bits/stdc++.h>

using i64 = long long;
const int M=5e5+10;
int l[M<<1],r[M<<1];

void solve() {
    std::string s;
    std::cin >> s;
    	int n = s.length();
    	s = " " + s;
    	s.resize((n << 1) + 1);
    	for(int i = 1; i <= n; ++i) s[i + n] = s[i];
    	for(int i = 1; i < (n << 1); ++i)
    	{
    		if (s[i] == s[i - 1]) l[i] = l[i - 1];
    		else l[i] = i;
		}
		l[n << 1] = 0;
		for(int i = (n << 1) - 1; i; --i)
		{
			if (l[i] == l[i + 1]) r[i] = r[i + 1];
			else r[i] = i;
		}
		int cnt = 0;
		int minn = n + 1, ans = 0;
		for(int i = 1; i <= n; ++i)
		{
			if (l[i] == i) cnt += (std::min(r[i], n) - i + 1) >> 1; 
		}//cout << n << '\n';
		for(int i = 1; i <= n; ++i)
		{
			if (cnt < minn)
			{
				minn = cnt;
				ans = i - 1;
			} 
			//cout << i << " " << cnt << '\n'; 
			if (s[i] == s[i + 1] && ((r[i] - i + 1) & 1) == 0) --cnt;
			if (s[i + n - 1] == s[i + n] && ((i + n - l[i + n] + 1) & 1) == 0) ++cnt;
		}
		std::cout << minn << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin>>t;

    while(t--){
        solve();
    }

    return 0;
}