#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef unsigned int uint;
typedef double db;
typedef long double ldb;
typedef vector <int> vi;
typedef vector <ll> vl;
struct pii { int x,y; };
struct pll { ll  x,y; };
typedef vector <pii> vii;
typedef vector <pll> vll;
#define pb push_back
const ll MOD = 998244353;
const int N = 100005;
const pii dir[4] = {{-1,0},{1,0},{0,-1},{0,1}};
pii operator + (pii x,pii y) {return {x.x+y.x,x.y+y.y};};
pii operator - (pii x,pii y) {return {x.x-y.x,x.y-y.y};};
inline int lowbit(int x) {return x&(-x);}
ll getgcd(ll x,ll y) {return (y==0) ? x : getgcd(y,x%y);}
ll power(ll x,ll mi,ll mod = MOD)
{
    ll s1=1LL,s2=x%mod,m=mi;
    for (;m;m>>=1) {if (m&1) s1=s1*s2%mod;s2=s2*s2%mod;}
    return s1;
}
inline ll getinv(ll x,ll mod = MOD) {return power(x,mod - 2);};
ll fac[N],ifac[N];
void count_prepare(ll mod = MOD)
{
    fac[0]=1;for (int i=1;i<N;++i) fac[i]=fac[i-1]*i%mod;
    ifac[N-1]=getinv(fac[N-1],mod);
    for (int i=N-2;i>=0;--i) ifac[i]=ifac[i+1]*(i+1)%mod;
}
ll C(ll n,ll m,ll mod = MOD)
{
    if (n<0 || m<0 || m>n) return 0;
    return 1LL*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
string st;
int a[N];
//int dp[N][26][26];
int n;
void init()
{
    cin>>st;
    n=st.size();
    a[0]=a[n+1]=a[n+2]=0;
    for (int i=1;i<=n;++i) a[i]=st[i-1]-'a'+1;
    //memset(dp,0,sizeof(dp[0])*(n+2));
    return;
}
int calc(int x1,int x2,int x3,int x4)
{
    for (int i=1;i<=26;++i)
    {
        if (i!=x1 && i!=x2 && i!=x3 && i!=x4) return i;
    }
    assert(0);
    return 0;
}
void solve()
{
    int ans=0;
    for (int i=2;i<=n;++i)
    {
        if (a[i]==a[i-1] || (i>2 && a[i]==a[i-2]))
        {
            a[i]=calc(a[i-1],a[i-2],a[i+1],a[i+2]);
            ++ans;
        }
    }
    cout<<ans<<endl;
    //cout<<"n="<<n<<endl;
    //for (int i=1;i<=n;++i) cout<<(char)('a'+a[i]-1)<<' ';cout<<endl;
    return;
}
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1;
    cin>>T;
//    T=read();
//    count_prepare();
    for (int cas=1;cas<=T;++cas)
    {
        //printf("Case %d : \n",cas);
        init();
        solve();
    }
    return 0;
}