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.util.*;
  import java.io.*;
  import java.math.BigInteger;
  
  public class Main {
  	static int[][] grid;
  
  	static int res[][];
  
  	public static void main(String[] args) throws IOException, InterruptedException {
  		Scanner sc = new Scanner(System.in);
  		PrintWriter pw = new PrintWriter(System.out);
  		int t = sc.nextInt();
  		while (t-- > 0) {
  			int n = sc.nextInt();
  			int[] arr = sc.nextIntArr(n);
  			int res = 1;
  			int nW = 0;
  			int w = 0;
  			for (int i = 0; i < arr.length; i++) {
  				if(arr[i]==1) {
  					nW = 0;
  					if(w<1) {
  						res++;
  						w++;
  					}
  					else {
  						res+=5;
  					}
  				}
  				else {
  					w = 0;
  					nW++;
  					if(nW==2) {
  						res = -1;
  						break;
  					}
  				}
  			}
  			pw.println(res);
  		}
  		pw.flush();
  	}
  
  	public static void solve(int i, int j) {
  
  		if (valid(i, j)) {
  			if (res[i][j] == -5 || res[i][j] == 1)
  				return;
  			int c = 0;
  			int c2 = 0;
  			if (valid(i + 1, j)) {
  				c++;
  				if (res[i + 1][j] == 1||res[i+1][j]==-5)
  					c2++;
  			}
  			if (valid(i, j + 1)) {
  				c++;
  				
  				if (res[i ][j+1] == 1||res[i][j+1]==-5)
  					c2++;
  			}
  			if (valid(i, j - 1)) {
  				c++;
  				
  				if (res[i][j - 1] == 1||res[i][j-1]==-5)
  					c2++;
  			}
  			if (valid(i - 1, j)) {
  				c++;
  				
  				if (res[i - 1][j] == 1||res[i-1][j]==-5)
  					c2++;
  			}
  			if (c == 0)
  				return;
  			if(c-c2<=1) {
  				res[i][j] = 1;
  				solve(i,j+1);
  				solve(i,j-1);
  				solve(i+1,j);
  				solve(i-1,j);
  			}
  		}
  	}
  
  	public static boolean valid(int i, int j) {
  		if (i < 0)
  			return false;
  		if (i >= grid.length)
  			return false;
  		if (j < 0)
  			return false;
  		if (j >= grid[0].length)
  			return false;
  		if (grid[i][j] == -1)
  			return false;
  		return true;
  	}
  }
  
  class segTree {
  	long[] arr, sTree;
  	int n;
  
  	public segTree(long[] a) {
  		n = 1;
  		while (n < a.length)
  			n <<= 1;
  
  		arr = new long[n + 1];
  		Arrays.fill(arr, Long.MAX_VALUE);
  		for (int i = 0; i < a.length; i++) {
  			arr[i + 1] = a[i];
  		}
  		sTree = new long[n << 1];
  		build(1, 1, n);
  	}
  
  	public void build(int curr, int l, int r) {
  //		if(l>r)
  //			return;
  		if (l == r) {
  			sTree[curr] = arr[curr - (n - 1)];
  			return;
  		}
  		int mid = (l + r) >> 1;
  		build(curr << 1, l, mid);
  		build((curr << 1) + 1, mid + 1, r);
  		sTree[curr] = Math.min(sTree[curr << 1], sTree[(curr << 1) + 1]);
  	}
  
  	public long q(int l, int r) {
  		return query(1, l, r, 1, n);
  	}
  
  	public long query(int curr, int qL, int qR, int l, int r) {
  		if (l >= qL && r <= qR) {
  			return sTree[curr];
  		}
  		if (r < qL || l > qR) {
  			return Long.MAX_VALUE;
  		}
  		int mid = (l + r) >> 1;
  		long left = query((curr << 1), qL, qR, l, mid);
  		long right = query((curr << 1) + 1, qL, qR, mid + 1, r);
  		return Math.min(left, right);
  	}
  
  	public void update(int i, int val) {
  		i = i + n - 1;
  		sTree[i] = val;
  		i >>= 1;
  		while (i >= 1) {
  			sTree[i] = sTree[i << 1] + sTree[(i << 1) + 1];
  			i >>= 1;
  		}
  	}
  }
  
  class Scanner {
  	StringTokenizer st;
  	BufferedReader br;
  
  	public Scanner(InputStream s) {
  		br = new BufferedReader(new InputStreamReader(s));
  	}
  
  	public String next() throws IOException {
  		while (st == null || !st.hasMoreTokens())
  			st = new StringTokenizer(br.readLine());
  		return st.nextToken();
  	}
  
  	public int nextInt() throws IOException {
  		return Integer.parseInt(next());
  	}
  
  	public long nextLong() throws IOException {
  		return Long.parseLong(next());
  	}
  
  	public String nextLine() throws IOException {
  		return br.readLine();
  	}
  
  	public double nextDouble() throws IOException {
  		String x = next();
  		StringBuilder sb = new StringBuilder("0");
  		double res = 0, f = 1;
  		boolean dec = false, neg = false;
  		int start = 0;
  		if (x.charAt(0) == '-') {
  			neg = true;
  			start++;
  		}
  		for (int i = start; i < x.length(); i++)
  			if (x.charAt(i) == '.') {
  				res = Long.parseLong(sb.toString());
  				sb = new StringBuilder("0");
  				dec = true;
  			} else {
  				sb.append(x.charAt(i));
  				if (dec)
  					f *= 10;
  			}
  		res += Long.parseLong(sb.toString()) / f;
  		return res * (neg ? -1 : 1);
  	}
  
  	public boolean ready() throws IOException {
  		return br.ready();
  	}
  
  	public int[] nextIntArr(int n) throws IOException {
  		int[] arr = new int[n];
  		for (int i = 0; i < arr.length; i++) {
  			arr[i] = nextInt();
  		}
  		return arr;
  	}
  
  	public long[] nextLongArr(int n) throws IOException {
  		long[] arr = new long[n];
  		for (int i = 0; i < arr.length; i++) {
  			arr[i] = nextLong();
  		}
  		return arr;
  	}
  }