B"Consider a simplified penalty phase at the end of a football match. A penalty phase consists of at most 10 kicks, the first team takes the first kick, the second team takes the second kick, then the first team takes the third kick, and so on. The team that scores more goals wins; if both teams score the same number of goals, the game results in a tie (note that it goes against the usual football rules). The penalty phase is stopped if one team has scored more goals than the other team could reach with all of its remaining kicks. For example, if after the 7 -th kick the first team has scored 1 goal, and the second team has scored 3 goals, the penalty phase ends -- the first team cannot reach 3 goals. You know which player will be taking each kick, so you have your predictions for each of the 10 kicks. These predictions are represented by a string s consisting of 10 characters. Each character can either be 1, 0, or ?. This string represents your predictions in the following way: Based on your predictions, you have to calculate the minimum possible number of kicks there can be in the penalty phase (that means, the earliest moment when the penalty phase is stopped, considering all possible ways it could go). Note that the referee doesn't take into account any predictions when deciding to stop the penalty phase -- you may know that some kick will/won't be scored, but the referee doesn't. The first line contains one integer t ( 1 <= t <= 1 ,000 ) -- the number of test cases. Each test case is represented by one line containing the string s , consisting of exactly 10 characters. Each character is either 1, 0, or ?. For each test case, print one integer -- the minimum possible number of kicks in the penalty phase. Consider the example test: In the first test case, consider the situation when the 1 -st, 5 -th and 7 -th kicks score goals, and kicks 2 , 3 , 4 and "...