#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vc;
typedef vector<long long> vl;
typedef vector<vector<long long>> vll;
typedef __int128_t int128;
#define rep(x, y, z) for(int x = (y); x <= (z); x++)
#define per(x, y ,z) for(int x = (y); x >= (z); x--)
#define yes cout << "YES\n"
#define no cout << "NO\n"

//#define int long long
//const int N = 1e5 + 5;
//const int mod = 1e9 + 7;
//const ll inf = 1e18;


void solve(){
	string s; cin >> s;
	int lens = s.size();
	s = ' ' + s;
	vi cost;
	rep(i, 1, lens){
		int r = i;
		while(s[i] == s[r] and r <= lens) r++;
		r--;
		int cnt = r - i + 1;
		if(cnt > 1){
			cost.push_back(cnt);
		}
		i = r;
	}
	int ans = 0;
	if(cost.size() == 0){
		cout << ans << '\n';
	}
	else{
		int maxx = *max_element(cost.begin(), cost.end());
		if(maxx == lens){
			cout << maxx / 2 << '\n';
			return;
		}
		ans += (maxx - 1) / 2;
		int lenc = cost.size();
		rep(i, 0, (int)lenc - 2){
			ans += cost[i] / 2;
		}
		cout << ans << '\n';
	}
}

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

	int __ = 1; cin >> __;
	while(__--){
		solve();
	}
	return 0;
}