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.io.*;
  import java.util.*;
   
  public class Solution {
   
      static class FastReader {
   
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
   
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() {
              return Integer.parseInt(next());
          }
   
          long nextLong() {
              return Long.parseLong(next());
          }
   
          double nextDouble() {
              return Double.parseDouble(next());
          }
   
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  
       public static boolean canReach(String s, int min, int max) {
          char[] c= s.toCharArray();
          int n=s.length();
          boolean[] res= new boolean[n];
          if(c[n-1]=='1')
              return false;
          res[0]=true;
          for(int i=1;i<n;i++)
          {
              for(int j=min;j<=max;j++)
              {
                  if((i-j)>=0&&c[i-j]=='0')
                      res[i]=true;
              }
          }
          for(boolean i:res)
              System.out.print(i+" ");
          System.out.println();
          return res[n-1];
      }
   
      public static void main(String[] args) {
   
          PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
   
          FastReader sc = new FastReader();
   
          int t=sc.nextInt();
          for(int i=0;i<t;i++)
          {
              int n=sc.nextInt();
  
              int[] arr= new int[n];
              for(int j=0;j<n;j++)
                  arr[j]=sc.nextInt();
  
              int start=1;
              if(arr[0]==1)
                  start++;
              for(int j=1;j<n;j++)
              {
                  if(arr[j]==1)
                  {
                      if(arr[j-1]==1)
                          start+=5;
                      else
                          start++;
                  }
                  else 
                  {
                      if(arr[j-1]==0)
                      {
                          //out.println(-1);
                          start=-1;
                          break;
                      }
  
                  }
              }
              out.println(start);
          }
  
  
          out.flush();
          out.close();
      }
  }