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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.StringTokenizer;
  import java.util.Vector;
  
  
  
  public class Flower {
      static class Pair {
          int ff;
          int ss;
          Pair(int a, int b) {
              ff = a;
              ss = b;
          }
      }
  
      public static void main(String [] args) {
          FastReader fs = new FastReader();
          int t = fs.nextInt();
          for (int i = 0; i < t; i++) {
              int n = fs.nextInt();
              int res = 1;
              boolean flag = false;
              boolean flag1 = false;
              for (int j = 0; j < n; j++) {
                  int tmp = fs.nextInt();
                  if (res == -1) continue;
                  if (tmp == 1 && flag) {
                      res += 5;
                      flag1 = false;
                  } else if (tmp == 1 && !flag){
                      res += 1;
                      flag = true;
                      flag1 = false;
                  } else {
                      flag = false;
                      if (flag1) {
                          res = -1;
                      }
                      flag1 = true;
                  }
              }
              System.out.println(res);
          }
      }
  
      static void solve() {
          
      }
  
      static void sort(ArrayList<Integer> arr) {
          Collections.sort(arr);
      }
      static void sort(int arr[]) {
          Arrays.sort(arr);
      }
  
      static int gcd (int a, int b) {
          if (b == 0) {
              return a;
          }
          return gcd(b, a%b);
      }
  
      static void pa(int arr[]) {
          System.out.println(Arrays.toString(arr));
      }
      static void pa(String arr[]) {
          System.out.println(Arrays.toString(arr));
      }
  
      static int[] sieve(int n) {
          int prime[] = new int[n];
          Arrays.fill(prime, 1);
          for (int i = 2; i < n; i++) {
              if (prime[i] == 1) {
                  for (int j = i*i; i <= n; j+=i) {
                      prime[i] = 0;
                  }
              }
          }
          return prime;
      }
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
          public 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;
          }
      }
  }
  