#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <cstring>

using ll = long long;

string s;

bool judge()
{
	for (int i = 1;i < s.size();i++)
		if (s[i] != s[0])
			return false;
	return true;
}

void solve()
{
	cin >> s;
	int n = s.size();
	if (judge())
	{
		cout << s.size() / 2 << '\n';
		return;
	}
	int ans = 0;
	int now = 1;
	bool flag = false;
	if (s[0] == s[s.size() - 1])
	{
		int pos = 0;
		while (s[pos] == s[0])
		{
			s += s[0];
			pos++;
		}
		s = s.substr(pos, n);
	}
	for (int i = 1;i < n;i++)
	{
		if (s[i] == s[i - 1])
			now++;
		else
		{
			ans += now / 2;
			if (now % 2 == 0) flag = true;
			now = 1;
		}
	}
	ans += now / 2;
	if (now % 2 == 0) flag = true;
	now = 1;
	//cout << ans << '\n';
	if (flag) cout << ans - 1 << '\n';
	else cout << ans << '\n';
}

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