def solve():
s=input()
one=s.count("1")
zero=s.count("0")
if one==zero: print(one-1)
else: print(min(one,zero))
t=int(input())
while t:
solve()
t-=1#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
string s;
for (int i = 0; i < n; i++){
string s;
cin >> s;
if(count(s.begin(), s.end(), '1')==count(s.begin(), s.end(), '0')){
cout << s.size()/2 -1 << endl;
}
else if(count(s.begin(), s.end(), '1')>count(s.begin(), s.end(), '0')){
cout << count(s.begin(), s.end(), '0') << endl;
}
else if(count(s.begin(), s.end(), '1')<count(s.begin(), s.end(), '0')){
cout << count(s.begin(), s.end(), '1') << endl;
}
}
return 0;
}
1041A - Heist | 901A - Hashing Trees |
1283A - Minutes Before the New Year | 1654D - Potion Brewing Class |
1107B - Digital root | 25A - IQ test |
785A - Anton and Polyhedrons | 1542B - Plus and Multiply |
306A - Candies | 1651C - Fault-tolerant Network |
870A - Search for Pretty Integers | 1174A - Ehab Fails to Be Thanos |
1169A - Circle Metro | 780C - Andryusha and Colored Balloons |
1153A - Serval and Bus | 1487C - Minimum Ties |
1136A - Nastya Is Reading a Book | 1353B - Two Arrays And Swaps |
1490E - Accidental Victory | 1335A - Candies and Two Sisters |
96B - Lucky Numbers (easy) | 1151B - Dima and a Bad XOR |
1435B - A New Technique | 1633A - Div 7 |
268A - Games | 1062B - Math |
1294C - Product of Three Numbers | 749A - Bachgold Problem |
1486B - Eastern Exhibition | 1363A - Odd Selection |