#include <stdio.h>
#include <string.h>
#include <assert.h>

#include <vector>
#include <numeric>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long LL;
constexpr int N = 1000005;

int n;
char s[N];

int solve() {
	scanf("%s", s);
	n = strlen(s);
	memcpy(s + n, s, n);
	int p = -1;
	for (int i = 1; i < n; ++i) {
		if (s[i] != s[i - 1]) {
			p = i;
			break;
		}
	}
	if (p == -1) {
		return n / 2;
	}
	for (int i = 0; i < n; ++i) {
		s[i] = s[i + p];
	}
	bool f = false; int tot = 0;
	for (int i = 0, j; (j = i) < n; i = j) {
		while (j < n && s[i] == s[j]) {
			++j;
		}
		tot += (j - i) / 2;
		if (!(j - i & 1)) {
			f = true;
		}
	}
	return tot - f;
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		printf("%d\n", solve());
	}
	return 0;
}