You are given a string (s). Each character is either 0 or 1 . You want all 1 's in the string to form a contiguous subsegment. For example, if the string is 0 , 1 , 00111 or 01111100 , then all 1 's form a contiguous subsegment, and if the string is 0101 , 100001 or 11111111111101 , then this condition is not met. You may erase some (possibly none) 0 's from the string. What is the minimum number of 0 's that you have to erase? The first line contains one integer (t) ((1 \le t \le 100)) — the number of test cases. Then (t) lines follow, each representing a test case. Each line contains one string (s) ((1 \le |s| \le 100)); each character of (s) is either 0 or 1 . Print (t) integers, where the (i)-th integer is the answer to the (i)-th testcase (the minimum number of 0 's that you have to erase from (s)). In the first test case you have to delete the third and forth symbols from string 010011 (it turns into 0111 ).