The success of IEEE code-quest depends on number of times the factor is present in a given string.Help core members to find them
 Factor of string is defined as a substring.In this case it's '01'.

Input
First line of input contains an integer T, denoting the number of test cases. Then follows description of T cases.Each line of input is a binary form.
 

Output
Print the number of times the factor is present in a given string.
 

Constraints

1 <= S <= 100000  
1 <= T <= 50

 

Example
Input:
1
1001010100001

Output:
4
'''
	Coded by Abhishek The Hacktivist
'''

test = int(raw_input())
for i in range(test):
	count = 0
	num = str(raw_input().split())
	for j in range(len(num)):
		if (num[j] == '0') and (num[j+1] == '1'):
			count += 1
	print count