|All-time Popular Problems|
|Sort a stack|
|Delete Middle of Linked List|
|BFS traversal of graph|
|Largest subarray of 0's and 1's|
|Immediate Smaller Element|
|Delete nodes having greater value on right|
|Node at a given index in linked list|
|Two numbers with sum closest to zero|
|Print all nodes that don’t have sibling|
Given a string, your task is to find the number of patterns of form 11 where  represents any number of zeroes (minimum requirement is one 0) there should not be any other character except 0 in the  sequence.
The first line contains T denoting the number of testcases. Then follows description of testcases. Each case contains a string.
For each test case, output the number of patterns.
1<=Length of String<=2000