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

#define int long long
using i64 = long long;

struct DSU {
    std::vector<int> parent, siz;

    DSU(int n) : parent(n + 1), siz(n + 1, 1) {
        std::iota(parent.begin(), parent.end(), 0);
    }

    int leader(int x) {
        if (x == parent[x]) {
            return x;
        } else {
            return parent[x] = leader(parent[x]);
        }
    }

    bool merge(int u, int v) {
        u = leader(u), v = leader(v);
        if (u == v) return false;
        siz[u] += siz[v];
        parent[v] = u;
        return true;
    }

    int size(int x) {
        return siz[leader(x)];
    }
};

void solve() {
    std::string s;
    std::cin >> s;
    s = ' ' + s;
    int n = s.size() - 1;
    DSU dsu(n);
    for (int i = 2; i <= n; i++) {
        if (s[i - 1] == s[i]) {
            dsu.merge(i - 1, i);
        }
    }
    if (s[1] == s[n]) {
        dsu.merge(1, n);
    }

    if (dsu.size(1) == n) {
        std::cout << n / 2 << "\n";
        return;
    }

    int sum = 0;
    int ans = 1E18;
    std::vector<int> q;
    int flag = 0;
    for (int i = 1; i <= n; i++) {
        // std::cerr << dsu.leader(i) << std::endl;
        if (dsu.leader(i) == i) {
            // std::cerr << i << std::endl;
            q.push_back(dsu.size(i));
            sum += dsu.size(i) / 2;
            if (dsu.size(i) % 2 == 0) {
                flag = 1;
            }
        }   
    }

    std::cout << sum - flag << "\n";

    
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int t = 1;
    std::cin >> t;
    while (t --) {
        solve();
    }
}