#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <tuple>
#include <iomanip>
#include <map>
#include <algorithm>
#include <math.h>
#include <string>
#include <vector>
#include <unordered_map>
#define ll long long
#define inf 10000000000007
#define mod 1000000007

using namespace std;

const int BLOCK = 450;


ll fastpow(ll n, ll x) {

	if (x == 0) {
		return 1;
	}
	else {
		ll ret = fastpow(n, x / 2);
		ret = ((ret % mod) * (ret % mod)) % mod;
		if (x % 2 == 0) {
			return ret;
		}
		else {
			return ((ret) * (n)) % mod;
		}
	}
}


ll gcd(ll a, ll b) {
	if (a == 0) {
		return b;
	}
	if (b == 0) {
		return a;
	}
	else {
		return gcd(b, a % b);
	}
}
ll lcm(ll a, ll b) {
	ll val = (a % mod * b % mod) % mod;
	val = (val * fastpow(gcd(a, b), mod - 2)) % mod;
	return val;
}
int Logk(ll n, ll k) {
	if (k == 1) {
		return 1;
	}
	if (n == 0) {
		return 0;
	}
	int count = -1;
	while (n > 0) {
		count++;
		n /= k;
	}
	return count;
}
struct Dsu {
	vector<int> par;

	void init(int n) {
		par.resize(n + 5, 0);
		for (int i = 1; i <= n; i++) par[i] = i;
	}

	int find(int u) {
		if (par[u] == u) return u;
		return par[u] = find(par[u]);
	}

	bool join(int u, int v) {
		u = find(u); v = find(v);
		if (u == v) return false;
		par[v] = u;
		return true;
	}
} dsu;


void solve() {
	string s;
	cin >> s;
	int n = s.length();
	vector<int> lap_end(n);
	vector<int> lap_start(n);
	ll cur = 0;
	for (int i = 0; i < n; i++) {
		int pos = -1;
		for (int j = i; j < n; j++) {
			if (s[j] == s[i]) {
				pos = j;
			}
			else {
				break;
			}
		}
		for (int j = i; j <= pos; j++) {
			lap_end[j] = pos;
			lap_start[j] = i;
		
		}
		cur += (pos - i + 1) / 2;
		i = pos;
		

	}

	ll ans = cur;
	
	for (int d = 1; d < n; d++) {
		ll ret = cur;
		int part1 = d - 1;
		
		if (lap_end[part1]  > part1) {
			
			ret -= (lap_end[part1] - lap_start[part1] + 1) / 2;
			if (lap_end[part1] == n - 1) {
				if (s[n - 1] != s[0]) {
					ret += (lap_end[part1] - part1) / 2;
					ret += (part1 - lap_start[part1] + 1) / 2;
				}
				else {
					if (lap_start[part1] == 0) {
						
						ret += (lap_end[part1] - lap_start[part1] + 1) / 2;
					}
					else {
						ret -= (lap_end[0] - lap_start[0] + 1) / 2;
						ret += (part1 - lap_start[part1] + 1) / 2;

						ret += (lap_end[part1] - part1 + lap_end[0] - lap_start[0] + 1) / 2;
					}
				}
			}
			else {
				

				ret += (lap_end[part1] - part1) / 2;
				if (lap_start[part1] == 0) {
					
					if (s[n - 1] == s[0]) {
						ret -= (lap_end[n-1] - lap_start[n-1] + 1) / 2;
						ret += (part1 - lap_start[part1] + 1 + lap_end[n-1] - lap_start[n-1] + 1) / 2;
					}
					else {
						ret += (part1 - lap_start[part1] + 1) / 2;
					}
					

				}
				else {
					ret += (part1 - lap_start[part1] + 1) / 2;
					if (s[n - 1] == s[0]) {
						ret -= (lap_end[n - 1] - lap_start[n - 1] + 1) / 2;
						ret -= (lap_end[0] - lap_start[0] + 1) / 2;
						
						ret += (lap_end[0] - lap_start[0] + 1 + lap_end[n - 1] - lap_start[n - 1] + 1) / 2;
					}
				}
				
			}
			
			
			
			
			
		}
		else {
			if (s[n - 1] == s[0]) {
				ret -= (lap_end[n - 1] - lap_start[n - 1] + 1) / 2;
				ret -= (lap_end[0] - lap_start[0] + 1) / 2;
				ret += (lap_end[0] - lap_start[0] + 1 + lap_end[n - 1] - lap_start[n - 1] + 1)/2;
			}
		}
		
		
		
		ans = min(ans, ret);
	}
	cout << ans << endl;
	
}



int main() {




	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	}






























}