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 cf {
   
      public static void main(String[] args){
   
          FastScanner sc = new FastScanner();
          int x = sc.nextInt();
          
          while(x-- > 0){
              int n=sc.nextInt();
              int []arr=new int[n];
              for(int i=0;i<n;i++){
                  arr[i]=sc.nextInt();
              }
              int h=1;
              boolean die=false;
              
              if(arr[0]==1){
                      h++;
                  }
              for(int i=1;i<n;i++){
                  
                  if(arr[i]==0 && arr[i-1]==0){
                      die=true;
                      
                  }
                  else if(arr[i]==1 && arr[i-1]==1){
                      h=h+5;
                  }
                  else if(arr[i]==1){
                      h++;
                  }
  
              }
              
              
              if(die){
                  System.out.println(-1);
              }
              else{
                  System.out.println(h);
  
              }
  
              
              
              
              
  
  
  
          }
          
  
      }
      
  
          
              
              
      }
      
   
      
      
      
   
  
  
  //////////////////////////////////////////////////////////////
  // LCM AND GCD
  /*
      public static int gcd(int a,int b){
          if(b == 0){
              return a;
          }
          return gcd(b,a%b);
      }
   
      public static int lcm(int a,int b){
           return (a / gcd(a, b)) * b;
      }*/
  
  
  ///////////////////////////////////////////////////////////////////////////////////
  
  //Iterator
  
  
  
  /*Iterator iterator = object.iterator();
   
          while (iterator.hasNext()) {
              System.out.print(iterator.next() + " ");
          }*/
  ///////////////////////////////////////////////////////////////////////////////////
  
  
  class FastScanner
  {
      //I don't understand how this works lmao
      private int BS = 1 << 16;
      private char NC = (char) 0;
      private byte[] buf = new byte[BS];
      private int bId = 0, size = 0;
      private char c = NC;
      private double cnt = 1;
      private BufferedInputStream in;
   
      public FastScanner() {
          in = new BufferedInputStream(System.in, BS);
      }
   
      public FastScanner(String s) {
          try {
              in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
          } catch (Exception e) {
              in = new BufferedInputStream(System.in, BS);
          }
      }
   
      public char getChar() {
          while (bId == size) {
              try {
                  size = in.read(buf);
              } catch (Exception e) {
                  return NC;
              }
              if (size == -1) return NC;
              bId = 0;
          }
          return (char) buf[bId++];
      }
   
      public int nextInt() {
          return (int) nextLong();
      }
   
      public int[] nextInts(int N) {
          int[] res = new int[N];
          for (int i = 0; i < N; i++) {
              res[i] = (int) nextLong();
          }
          return res;
      }
   
      public long[] nextLongs(int N) {
          long[] res = new long[N];
          for (int i = 0; i < N; i++) {
              res[i] = nextLong();
          }
          return res;
      }
   
      public long nextLong() {
          cnt = 1;
          boolean neg = false;
          if (c == NC) c = getChar();
          for (; (c < '0' || c > '9'); c = getChar()) {
              if (c == '-') neg = true;
          }
          long res = 0;
          for (; c >= '0' && c <= '9'; c = getChar()) {
              res = (res << 3) + (res << 1) + c - '0';
              cnt *= 10;
          }
          return neg ? -res : res;
      }
   
      public double nextDouble() {
          double cur = nextLong();
          return c != '.' ? cur : cur + nextLong() / cnt;
      }
   
      public double[] nextDoubles(int N) {
          double[] res = new double[N];
          for (int i = 0; i < N; i++) {
              res[i] = nextDouble();
          }
          return res;
      }
   
      public String next() {
          StringBuilder res = new StringBuilder();
          while (c <= 32) c = getChar();
          while (c > 32) {
              res.append(c);
              c = getChar();
          }
          return res.toString();
      }
   
      public String nextLine() {
          StringBuilder res = new StringBuilder();
          while (c <= 32) c = getChar();
          while (c != '\n') {
              res.append(c);
              c = getChar();
          }
          return res.toString();
      }
   
      public boolean hasNext() {
          if (c > 32) return true;
          while (true) {
              c = getChar();
              if (c == NC) return false;
              else if (c > 32) return true;
          }
      }
  }
  
  