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: 
  
  import java.util.*;
  public class Codeforces {
  
  
  	// CHECK CONSTRAINTS ALWAYS EDGE CASE MISSED 
  	
  static int mod = 1000000007;	
   public static void main(String[] args) {
  
  Scanner sc=  new Scanner(System.in);
  while(sc.hasNext()) {
  
  int t   =sc.nextInt();
  while(t-->0) {
  
  int n  =  sc.nextInt();
  int a[] = new int[n];
  
  for(int i = 0 ;  i<n;i++) {
  	a[i] = sc.nextInt();
  }
  
  boolean flag = true;
  
  int cnt = 0;
  int z = 0;
  int ans = 1;
  for(int i = 0 ; i  <n;i++)
  {
  	
  if(a[i] == 1) {
  cnt++;
  
  if(cnt == 1) {
     ans++;
     z = 0;
     
  }
  else {
  z = 0;
  	ans+=5;
  
  }
  
  
  }
  else {
  	z++;
  
  	if(z == 1) {
  		cnt = 0;
  	}
  	else {
  		flag = false;
  		break;
  	}
  
  }
  
  
  
  }
  
  
  
  if(flag) {
  
  	System.out.println(ans);
  	
  }
  else {
  	System.out.println(-1);
  }
  
  
  
  
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  }
  }
  } 
  
  
  
  
  
  
  
  
  	
  
  
  
   
   static void primeFactors(long n , ArrayList<Integer> al) {
  	 while(n%2 == 0) {
  		 al.add(2);
  		 n  = n/2;
  	 }
  	
  	 for(int i = 3 ; i*i<= n;i+=2) {
  		 while(n%i == 0) {
  			 al.add(i);
  			 n = n/i;
  		 }
  	 }
  	
  	if(n>2) {
  		al.add((int) n);
  	}
   }
   
   
   
   static class Pair implements Comparable<Pair>{
  	 int a;
  	 int b;
  	 Pair(int a, int b){
  		 this.a = a;
  		 this.b = b;
  	 }
  	@Override
  	public int compareTo(Pair o) {
  		// TODO Auto-generated method stub
  	int temp =  this.a - o.a;
  	if(temp == 0) {
  	  return this.b - o.b;	
  	}
  	else {
  	return temp;	
  	}
  	
  	
  	}
  	 
  	 
   }
   
   
   
   
   static long gcd(long a ,  long b) {
  	 if(b == 0) {
  		 return a;
  	 }
  	 
  	 return gcd(b, a%b);
   }
   
   
    static boolean isPalindrome(int a[]) {
  	  int i= 0;
  	  int j = a.length - 1;
  	  
  	  while(i<=j) {
  		  if(a[i] != a[j]) {
  		      return false;	  
  		  }
  		  i++;
  		  j--;
  	  }
  	  
  	  return true;
  	  
    }
   
   
   
   static boolean isSubsequence(String a , String b) {
  	 
  	int i = 0 , j = 0;
  	while(i<a.length() && j<b.length()) {
  		
  		if(a.charAt(i) == b.charAt(j)) {
  			i++;
  			j++;
  		}
  		else {
  			j++;
  		}
  	}
  	
  	if(i == a.length()) {
  		return true;
  	}
  	return false;
  	
   }
  
   
   
   
   
   }
  
  
  
  
          
  
  
  
  
  		
  
  
          
  
  
  
  
  		