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

//  The 2024 ICPC Kunming Invitational Contest

void sol(){
    std::string s;
    std::cin>>s;

    int n = s.length();
    if(std::count(s.begin(), s.end(), s[0]) == n){
        std::cout<<n / 2<<"\n";
        return ;
    }

    s.insert(s.end(), s.begin(), s.end());
    s = ' ' + s + ' ';

    int N = 2 * n;
    std::vector<int>pre(N + 2), suf(N + 2);

    std::iota(pre.begin(), pre.end(), 0);
    std::iota(suf.begin(), suf.end(), 0);

    for(int i = 1;i <= N;i++){
        if(s[i] == s[i - 1]){
            pre[i] = pre[i - 1];
        }
    }

    for(int i = N;i >= 1;i--){
        if(s[i] == s[i + 1]){
            suf[i] = suf[i + 1];
        }
    }

    const int M = 20;
    std::vector<std::vector<int>>cost(N + 2, std::vector<int>(M));
    std::vector<std::vector<int>>nxt(N + 2, std::vector<int>(M, N + 1));

    for(int i = N;i>=1;i--){
        cost[i][0] = (suf[i] - i + 1) / 2;
        nxt[i][0] = suf[i] + 1;
    }

    for(int j = 1;j < M;j++){
        for(int i = 1;i <= N;i++){
            if(nxt[i][j - 1] != N + 1){
                cost[i][j] = cost[i][j - 1] + cost[nxt[i][j - 1]][j - 1];
                nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
            }
        }
    }

    int ans = N;
    for(int i = 1;i <= n;i++){
        int now = i, cur = 0, ed = i + n - 1;
        for(int j = M - 1;j >= 0;j--){
            if(nxt[now][j] <= ed){
                cur += cost[now][j];
                now = nxt[now][j];
            }
        }
        if(now <= ed){
            cur += (ed - now + 1) / 2;
        }
        ans = std::min(ans, cur);
    }

    std::cout<<ans<<"\n";
}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1; std::cin>>t;
    while(t--) sol();  
    return 0;
}