#include <bits/stdc++.h>

using namespace std;

#define F(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(0)

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

int main() {
  IOS;
  cin.tie(0), cout.tie(0);

  string s;
  int t;
  cin >> t;
  while (t--) {
    cin >> s;
    int n = s.size(), base = 0;
    int cnt = 1;
    F(i, 0, n) {
      if (i != n - 1 && s[i] == s[i + 1]) {
        cnt++;
      } else {
        if (cnt == i + 1 && cnt != n) {
          int j = 0;
          while (s[n - 1 - j] == s[0]) {
            j++, cnt++;
          }
        }
        if (cnt % 2 == 0) {
          base = i;
          break;
        }
        cnt = 1;
      }
    }
    int ans = 0;
    F(i, 0, n - 1) {
      if (s[(base + i) % n] == s[(base + i + 1) % n]) {
        ans++, i++;
      }
    }
    cout << ans << '\n';
  }
}