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.IOException;
  
      import java.io.IOException;
      import java.io.InputStream;
      import java.io.PrintWriter;
      import java.util.ArrayList;
      import java.util.Collections;
      import java.util.InputMismatchException;
      import java.util.List;
  
      public class LifeofaFlower {
          static InputReader inputReader=new InputReader(System.in);
          static void solve()
          {
              int height=1;
              int n=inputReader.nextInt();
              int arr[]=inputReader.nextIntArray(n);
              for (int i=0;i<n;i++)
              {
                  if (i-1>=0)
                  {
                      if (arr[i]==1&&arr[i-1]==1)
                      {
                          height+=5;
                      }
                      else if (arr[i]==1)
                      {
                          height+=1;
                      }
                      else if (arr[i-1]==0&&arr[i]==0)
                      {
                          out.println(-1);
                          return;
                      }
                  }
                  else
                  {
                      if (arr[i]==1)
                      {
                          height+=1;
                      }
                  }
              }
              out.println(height);
          }
          static PrintWriter out=new PrintWriter((System.out));
          public static void main(String args[])throws IOException
          {
              int t=inputReader.nextInt();
              while (t-->0) {
                  solve();
              }
                  out.close();
          }
  
          static void Sort(int arr[])
          {
              List<Integer>list=new ArrayList<>();
              for (int ele:arr)
              {
                  list.add(ele);
              }
              Collections.sort(list);
              for (int i=0;i<list.size();i++)
              {
                  arr[i]=list.get(i);
              }
          }
          static void sortDec(int arr[])
          {
              int len=arr.length;
              List<Integer>list=new ArrayList<>();
              for(int ele:arr)
              {
                  list.add(ele);
              }
              Collections.sort(list,Collections.reverseOrder());
              for(int i=0;i<len;i++) {
                  arr[i] = list.get(i);
              }
          }
          static class InputReader {
  
              private InputStream stream;
              private byte[] buf = new byte[8192];
              private int curChar, snumChars;
              private SpaceCharFilter filter;
  
              public InputReader(InputStream stream) {
                  this.stream = stream;
              }
  
              public int snext() {
                  if (snumChars == -1)
                      throw new InputMismatchException();
                  if (curChar >= snumChars) {
                      curChar = 0;
                      try {
                          snumChars = stream.read(buf);
                      } catch (IOException e) {
                          throw new InputMismatchException();
                      }
                      if (snumChars <= 0)
                          return -1;
                  }
                  return buf[curChar++];
              }
  
              public int nextInt() {
                  int c = snext();
                  while (isSpaceChar(c))
                      c = snext();
                  int sgn = 1;
                  if (c == '-') {
                      sgn = -1;
                      c = snext();
                  }
                  int res = 0;
                  do {
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = snext();
                  } while (!isSpaceChar(c));
                  return res * sgn;
              }
  
              public long nextLong() {
                  int c = snext();
                  while (isSpaceChar(c))
                      c = snext();
                  int sgn = 1;
                  if (c == '-') {
                      sgn = -1;
                      c = snext();
                  }
                  long res = 0;
                  do {
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = snext();
                  } while (!isSpaceChar(c));
                  return res * sgn;
              }
  
              public int[] nextIntArray(int n) {
                  int a[] = new int[n];
                  for (int i = 0; i < n; i++)
                      a[i] = nextInt();
                  return a;
              }
  
              public String readString() {
                  int c = snext();
                  while (isSpaceChar(c))
                      c = snext();
                  StringBuilder res = new StringBuilder();
                  do {
                      res.appendCodePoint(c);
                      c = snext();
                  } while (!isSpaceChar(c));
                  return res.toString();
              }
  
              public boolean isSpaceChar(int c) {
                  if (filter != null)
                      return filter.isSpaceChar(c);
                  return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
              }
  
              public interface SpaceCharFilter {
                  public boolean isSpaceChar(int ch);
              }
          }
      }
  