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 A {
      static boolean[] isPrime;
  
      public static void main(String[] args) {
          FastScanner sc=new FastScanner();
          PrintWriter pw=new PrintWriter(System.out);
          int ts=sc.nextInt();
          while(ts-- > 0){
              int n=sc.nextInt();
              int[] arr=sc.readArray(n);
              int ans=1;
              if(arr[0]==1){
                  ans++;
              }
              for(int i=1;i<n;i++){
                 if(arr[i]==1 && arr[i-1]==1){
                  ans+=5;
                 }
                 else if(arr[i]==0 && arr[i-1]==0){
                  ans=-1;
                  break;
                 }
                 else if(arr[i]==1){
                  ans++;
                 }
              }
              pw.println(ans);
          }
  
          pw.flush();  
      }
  
  
      public static long npr(int n, int r) {
          long ans = 1;
          for(int i= 0 ;i<r; i++) {
              ans*= (n-i);
          }
          return ans;
      }
  
      public static double ncr(int n, int r) {
          double ans = 1;
          for(int i= 0 ;i<r; i++) {
              ans*= (n-i);
          }
          for(int i= 0 ;i<r; i++) {
              ans/=(i+1);
          }
          return ans;
      }
  
      public static void fillPrime() {
          int n = 1000005;
          isPrime=new boolean[n];
          Arrays.fill(isPrime, true);
          isPrime[0] = isPrime[1] = false;
          for (int i = 2; i * i < n; i++) {
              if (isPrime[i]) {
                  for (int j = i * i; j < n; j += i) {
                      isPrime[j] = false;
                  }
              }
          }
      }
  
  
      static class FastScanner {
          BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st=new StringTokenizer("");
          String next() {
              while (st == null  || !st.hasMoreTokens()) {
                  try {
                      st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          String nextLine() {
              String str = "";
              try
              {
                  str = br.readLine();
              }
              catch (IOException e)
              {
                  e.printStackTrace();
              }
              return str;
          }
          int nextInt() {
              return Integer.parseInt(next());
          }
          int[] readArray(int n) {
              int[] a=new int[n];
              for (int i=0; i<n; i++) a[i]=nextInt();
              return a;
          }
          long nextLong() {
              return Long.parseLong(next());
          }
          double nextDouble() {
              return Double.parseDouble(next());
          }
      }
  
  }
  