description: Petya has got an interesting flower. Petya is a busy person, so he sometimes forgets to water it. You are given n days from Petya's live and you have to determine what happened with his flower in the end.
  
  The flower grows as follows: 
  
    * If the flower isn't watered for two days in a row, it dies. 
    * If the flower is watered in the i-th day, it grows by 1 centimeter. 
    * If the flower is watered in the i-th and in the (i-1)-th day (i > 1), then it grows by 5 centimeters instead of 1. 
    * If the flower is not watered in the i-th day, it does not grow. 
  
  
  
  At the beginning of the 1-st day the flower is 1 centimeter tall. What is its height after n days?
  
  Input
  
  Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.
  
  The first line of each test case contains the only integer n (1 ≤ n ≤ 100).
  
  The second line of each test case contains n integers a_1, a_2, ..., a_n (a_i = 0 or a_i = 1). If a_i = 1, the flower is watered in the i-th day, otherwise it is not watered.
  
  Output
  
  For each test case print a single integer k — the flower's height after n days, or -1, if the flower dies.
  
  Example
  
  Input
  
  
  4
  3
  1 0 1
  3
  0 1 1
  4
  1 0 0 1
  1
  0
  
  
  Output
  
  
  3
  7
  -1
  1
solution: /******************************************************************************
  
  Welcome to GDB Online.
  GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
  C#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
  Code, Compile, Run and Debug online from anywhere in world.
  
  *******************************************************************************/
  import java.util.Scanner;
  import java.util.ArrayList;
  public class Main
  {
  	public static void main(String[] args) {
  	ArrayList<Integer> arrq= new ArrayList<>();
  	Scanner sc = new Scanner(System.in);
  	int test_case= sc.nextInt();
  	int health=1;
  	int stop=0;
  	for(int i=0;i<test_case;i++)
  	{   health=1;
  	    stop=0;
  	    int length=sc.nextInt();
  	    int []arr= new int[length];
  	    
  	    for(int k=0;k<arr.length;k++)
  	    {
  	        arr[k] = sc.nextInt(); 
  	    }
  	    
  	    
  	    
  	    int count_zero=0;
  	    int count_one=0;
  	    stop=0;
  	    for(int j=0; j<arr.length;j++)
  	    {
  	        if(stop==1)
  	        {
  	            break;
  	        }
  	        
  	        
  	        if(arr[j]==0)
  	        {count_zero+=1;   
  	           
  	            
  	             if(count_one>0)
  	            {
  	                 count_one=0;
  	            }
  	            
  	            if(count_zero>=2)
  	            {  
  	                health=-1;
  	               
  	                stop+=1;
  	                break;
  	                
  	            }
  	          
  	            
  	       
  	            
  	        }
  	       
  	        
  	        else if(arr[j]==1)
  	        { 
  	            count_one+=1;
  	            if(count_zero>0)
  	            {
  	                 count_zero-=1;
  	            }
  	       
  	            if(count_one>=2)
  	            {
  	               health+=5; 
  	            }
  	            else{
  	                health+=1;
  	            } 
  	            
  	           
  	        }
  	      
  	        
  	    }
  	    
  	  arrq.add(health);  
  	   
  	}
  	//	System.out.println(stop);
  	for(int i : arrq)
  	{
  	    	System.out.println(i);
  	}
  
  	}
  }
  