#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define gcd __gcd
using namespace std;
typedef pair<int,int> pii;
const int INF = 9e18;
const int inf = 2e9;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int qmi(int a,int k)
{
    int res = 1;
    while(k)
    {
        if(k & 1) res = res * a % mod;
        k >>= 1;
        a = a * a % mod;
    }
    return res;
}
int inv(int x)
{
    return qmi(x,mod-2);
}
int MOD(int x)
{
    return (x % mod + mod) % mod;
}
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t --)
    {
        string s;
        cin >> s;
        int n = s.size();
        int now = 0;
        int ma = 0;
        s = " " + s + s;
        int fi = 1;
        for(int i = 1;i <= n;i ++)
        {
            if(s[i] != s[i + n-1])
            {
                fi = i;
                break;
            }
        }

        for(int i = fi;i < fi + n; i ++)
        {
            int j = i;
            while(j + 1 < fi + n && s[j + 1] == s[i])
            {
                j++;
            }
            now += (j - i + 1) / 2;
            if((j -i+1) % 2 == 0) ma = max(ma,j - i + 1);
            i = j;
        }
        if(s[fi] != s[fi + n - 1] && ma >= 2) cout << now -1 << endl;
        else cout << now << endl;
    }
}