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 Flower {
      static StringBuilder out = new StringBuilder();
  
      public static void main(String[] args) {
          int n = ni();
          while (n-- > 0) {
              int numOfDay = ni();
              int tall = 1;
              int preDay = -1;
              boolean dead = false;
              for (int i = 0; i < numOfDay; i++) {
                  int day = ni();
                  if (day == 1) {
                      if (preDay == 1) {
                          tall += 5;
                      } else {
                          tall += 1;
                      }
                  } else {
                      if (preDay == 0) {
                          dead = true;
                      }
                  }
                  preDay = day;
              }
              if (dead) {
                  out.append("-1").append("\n");
                  continue;
              }
              out.append(tall).append("\n");
  
          }
          System.out.println(out);
      }
  
      static InputStream is = System.in;
      static byte[] inbuf = new byte[1 << 24];
      static int lenbuf = 0, ptrbuf = 0;
  
      static int readByte() {
          if (lenbuf == -1)
              throw new InputMismatchException();
          if (ptrbuf >= lenbuf) {
              ptrbuf = 0;
              try {
                  lenbuf = is.read(inbuf);
              } catch (IOException e) {
                  throw new InputMismatchException();
              }
              if (lenbuf <= 0)
                  return -1;
          }
          return inbuf[ptrbuf++];
      }
  
      static boolean isSpaceChar(int c) {
          return !(c >= 33 && c <= 126);
      }
  
      static int skip() {
          int b;
          while ((b = readByte()) != -1 && isSpaceChar(b))
              ;
          return b;
      }
  
      static double nd() {
          return Double.parseDouble(ns());
      }
  
      static char nc() {
          return (char) skip();
      }
  
      static String ns() {
          int b = skip();
          StringBuilder sb = new StringBuilder();
          while (!(isSpaceChar(b))) {
              sb.appendCodePoint(b);
              b = readByte();
          }
          return sb.toString();
      }
  
      static char[] ns(int n) {
          char[] buf = new char[n];
          int b = skip(), p = 0;
          while (p < n && !(isSpaceChar(b))) {
              buf[p++] = (char) b;
              b = readByte();
          }
          return n == p ? buf : Arrays.copyOf(buf, p);
      }
  
      static int ni() {
          int num = 0, b;
          boolean minus = false;
          while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
              ;
          if (b == '-') {
              minus = true;
              b = readByte();
          }
          while (true) {
              if (b >= '0' && b <= '9') {
                  num = num * 10 + (b - '0');
              } else {
                  return minus ? -num : num;
              }
              b = readByte();
          }
      }
  
      static long nl() {
          long num = 0;
          int b;
          boolean minus = false;
          while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
              ;
          if (b == '-') {
              minus = true;
              b = readByte();
          }
          while (true) {
              if (b >= '0' && b <= '9') {
                  num = num * 10 + (b - '0');
              } else {
                  return minus ? -num : num;
              }
              b = readByte();
          }
      }
  }
  