#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int n = s.size();
    vector<int> l(n, 0), r(n + 1, 0);
    for (int i = 0; i < n; ++i) {
      l[i] = (s[i] == '0') + ((i == 0) ? 0 : l[i - 1]);
    }
    for (int i = n - 1; i >= 0; --i) {
      r[i] = (s[i] == '0') + ((i == n - 1) ? 0 : r[i + 1]);
    }
    int ans = n;
    for (int i = 0; i < n; ++i) {
      ans = min(ans, min(i + 1 - l[i] + r[i + 1], l[i] + n - i - 1 - r[i + 1]));
    }
    cout << ans << '\n';
  }
  return 0;
}
