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: // package c1591;
  
  import java.io.File;
  import java.lang.invoke.MethodHandles;
  import java.util.Random;
  import java.util.Scanner;
  
  //
  // Codeforces Round #TBA (Div. 2, based on Technocup 2022 Elimination Round 3) 2021-12-12 07:05
  // A. Life of a Flower
  // https://codeforces.com/contest/1591/problem/A
  // time limit per test 1 second; memory limit per test 256 megabytes
  // public class Pseudo for 'Source should satisfy regex [^{}]*public\s+(final)?\s*class\s+(\w+).*'
  //
  // 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 <=q n <=q 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
  */
  //
  public class C1591A {
    static final int MOD = (int)1e9+7;
    static final Random RAND = new Random();
  
    static int solve(int[] a) {
      int n = a.length;
      int height = 1;
      for (int i = 0; i < n; i++) {
        if (a[i] == 0) {
          if (i > 0 && a[i-1] == 0) {
            return -1;
          }
        } else {
          height += (i > 0 && a[i-1] == 1) ? 5 : 1;
        }
      }
      return height;
    }
  
    public static void main(String[] args) {
      Scanner in = getInputScanner();
      int T = in.nextInt();
      for (int t = 1; t <= T; t++) {
        int n = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
          a[i] = in.nextInt();
        }
        int ans = solve(a);
        System.out.println(ans);
      }
      in.close();
    }
  
    static Scanner getInputScanner() {
      try {
        final String USERDIR = System.getProperty("user.dir");
        final String CNAME = MethodHandles.lookup().lookupClass().getSimpleName();
        final File fin = new File(USERDIR + "/io/c" + CNAME.substring(1,5) + "/" + CNAME + ".in");
        return fin.exists() ? new Scanner(fin) : new Scanner(System.in);
      } catch (Exception e) {
        return new Scanner(System.in);
      }
    }
  }
  