#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  string s;
  cin >> s;
  string t;
  for (auto &c : s) {
    if (t.empty() || t.back() != c) t.push_back(c);
  } 
  array<int, 26> cnt = {};
  for (auto c : t) cnt[c - 'A'] += 1;
  int res = 0;
  for (int i = 0; i < 26; i++) if (cnt[i] > 0) res += cnt[i] - 1;
  cout << (res + 1) / 2 << "\n";
  
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}