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

#define int long long
#define P pair<int,int>

const int mod = 1e9 + 7, inf = 1e17;

void run(){
    string s;
    cin >> s;
    int n = s.size();
    int ans = 0;
    vector<int> g;
    int ok = 0;
    for(int i=0;i<n;i++){
        int res = 1;
        while(i < n - 1 && s[i] == s[i + 1]){
            i ++;
            res ++;
        }
        g.push_back(res);
        ans += res / 2;
        ok |= (res % 2 == 0);
    }
    if(g.size() == 1){
        cout << ans << '\n';
        return;
    }
    if(s[0] == s[n - 1]){
        int x = *g.begin();
        int y = g.back();
        cout << ans - (x % 2 == 0 && y % 2 == 0) << '\n';
    }
    else{
        cout << ans - ok << '\n';
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int T = 1;
    cin >> T;
    while(T --) run(); return 0;
}