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: // HOPE
  
  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  //----------------------------------------------------------------------------------------------------------------------
  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  //----------------------------------------------------------------------------------------------------------------------
  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  ///////                                                                                                       //////////
  ///////                                                                                                       //////////
  ///////            RRRRRRRRRRRRR     YY          YY         AA               NN          NN                   //////////
  ///////            RR         RR      YY        YY        AA  AA             NN NN       NN                   //////////
  ///////            RR        RR         YY     YY        AA    AA            NN  NN      NN                   //////////
  ///////            RRRRRRRRRR            YY   YY       AAAAAAAAAAAA          NN    NN    NN                   //////////
  ///////            RR RR                   YY         AAAAAAAAAAAAAA         NN      NN  NN                   //////////
  ///////            RR   RR                 YY        AA            AA        NN       NN NN                   //////////
  ///////            RR     RR               YY       AA              AA       NN          NN                   //////////
  ///////            RR       RR_____________________________________________________________________________   //////////
  ////////                                                                                                      //////////
  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  //----------------------------------------------------------------------------------------------------------------------
  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  //----------------------------------------------------------------------------------------------------------------------
  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  import java.math.*;
  
  public class Codeforces1 {
      static PrintWriter out = new PrintWriter(System.out);
      static final int mod=1_000_000_007;
  
      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());
          }
  
          int[] readIntArray(int n){
              int[] a = new int[n];
              for(int i=0;i<n;i++)
                  a[i] = nextInt();
              return a;
          }
  
          long[] readLongArray(int n){
              long[] a = new long[n];
              for(int i=0;i<n;i++)
                  a[i] = nextLong();
              return a;
          }
  
          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;
          }
      }
  
      //Try seeing general case
      public static void main(String[] args) {
          FastReader s = new FastReader();
          int t = s.nextInt();
          while(t-->0)
          {
              int n = s.nextInt();
              int[] a = s.readIntArray(n);
              out.println(find(n, a));
          }
  
  
          out.close();
      }
  
      public static int find(int n, int[] a)
      {
          int height = 1;
          if(a[0]==1)
              height += 1;
  
          for(int i=1;i<n;i++)
          {
              if(a[i]==1)
              {
                  if(a[i-1]==1)
                      height+=5;
                  else
                      height+=1;
              }
              else
              {
                  if(a[i-1]==0)
                      return -1;
              }
          }
          return height;
      }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
      /////////////////////////////////////////////////THE END///////////////////////////////////////////////////////////
      //////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  
      public static int gcd(int x,int y)
      {
          return y==0?x:gcd(y,x%y);
      }
      public static long gcd(long x,long y)
      {
          return y==0L?x:gcd(y,x%y);
      }
  
      public static int lcm(int a, int b) {
          return (a * b) / gcd(a, b);
      }
      public static long lcm(long a, long b) {
          return (a * b) / gcd(a, b);
      }
  
      public static long pow(long a,long b)
      {
          if(b==0L)
              return 1L;
          long tmp=1;
          while(b>1L)
          {
              if((b&1L)==1)
                  tmp*=a;
              a*=a;
              b>>=1;
          }
          return (tmp*a);
      }
  
      public static long modPow(long a,long b,long mod)
      {
          if(b==0L)
              return 1L;
          long tmp=1;
          while(b>1L)
          {
              if((b&1L)==1L)
                  tmp*=a;
  
              a*=a;
              a%=mod;
              tmp%=mod;
              b>>=1;
          }
          return (tmp*a)%mod;
      }
  
      static long mul(long a, long b) {
          return a*b%mod;
      }
  
      static long fact(int n) {
          long ans=1;
          for (int i=2; i<=n; i++) ans=mul(ans, i);
          return ans;
      }
  
      static long fastPow(long base, long exp) {
          if (exp==0) return 1;
          long half=fastPow(base, exp/2);
          if (exp%2==0) return mul(half, half);
          return mul(half, mul(half, base));
      }
  
      static void debug(int ...a)
      {
          for(int x: a)
              out.print(x+" ");
          out.println();
      }
  
      static void debug(long ...a)
      {
          for(long x: a)
              out.print(x+" ");
          out.println();
      }
  
      static void debugMatrix(int[][] a)
      {
          for(int[] x:a)
              out.println(Arrays.toString(x));
      }
      static void debugMatrix(long[][] a)
      {
          for(long[] x:a)
              out.println(Arrays.toString(x));
      }
  
      static void reverseArray(int[] a) {
          int n = a.length;
          int[] arr = new int[n];
          for (int i = 0; i < n; i++)
              arr[i] = a[n - i - 1];
          for (int i = 0; i < n; i++)
              a[i] = arr[i];
      }
  
      static void reverseArray(long[] a) {
          int n = a.length;
          long[] arr = new long[n];
          for (int i = 0; i < n; i++)
              arr[i] = a[n - i - 1];
          for (int i = 0; i < n; i++)
              a[i] = arr[i];
      }
  
      static void sort(int[] a)
      {
          ArrayList<Integer> ls = new ArrayList<>();
          for(int x: a) ls.add(x);
          Collections.sort(ls);
          for(int i=0;i<a.length;i++)
              a[i] = ls.get(i);
      }
  
      static void sort(long[] a)
      {
          ArrayList<Long> ls = new ArrayList<>();
          for(long x: a) ls.add(x);
          Collections.sort(ls);
          for(int i=0;i<a.length;i++)
              a[i] = ls.get(i);
      }
  
      static class Pair{
          int x, y;
          Pair(int x, int y)
          {
              this.x = x;
              this.y = y;
          }
  
          @Override
          public String toString() {
              return "Pair{" +
                      "x=" + x +
                      ", y=" + y +
                      '}';
          }
      }
      static class MyCmp implements Comparator<Pair>
      {
          public int compare(Pair p1, Pair p2)
          {
              return p1.x-p2.x;
          }
      }
  }