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 static java.lang.Math.*;
  import java.io.*;
  import java.math.*;
  import java.util.*;
  
  public class cf2 {
  	static FastReader x = new FastReader();
  	static OutputStream outputStream = System.out;
  	static PrintWriter out = new PrintWriter(outputStream);
  
  	/*---------------------------------------CODE STARTS HERE-------------------------*/
  	public static void main(String[] args) {
  
  		int t = x.nextInt();
  		StringBuilder str = new StringBuilder();
  		while (t > 0) {
  			int n =x.nextInt();
  			int a[]=new int[n];
  			int ans=1;
  			int p=-1;
  			for(int i=0;i<n;i++) {
  				a[i]=x.nextInt();
  			}
  			for(int i=0;i<n;i++) {
  				if(a[i]==1&&p!=1) {
  					ans++;
  					p=1;
  				}else if(p==1&&a[i]==1) {
  					ans+=5;
  					p=1;
  				}
  				else if(p==0&&a[i]==0) {
  					p=-2;
  					break;
  				}else {
  					p=a[i];
  				}
  //				System.out.println(i+" "+ans+" "+p);
  			}
  			if(p==-2)
  				System.out.println(-1);
  			else
  				System.out.println(ans);
  			str.append("\n");
  			t--;
  		}
  		out.println(str);
  		out.flush();
  	}
  
  	/*--------------------------------------------FAST I/O--------------------------------*/
  	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());
  		}
  
  		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;
  		}
  
  		char nextchar() {
  			char ch = ' ';
  			try {
  				ch = (char) br.read();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return ch;
  		}
  	}
  
  	/*--------------------------------------------BOILER PLATE---------------------------*/
  	static int[] readarr(int n) {
  		int arr[] = new int[n];
  		for (int i = 0; i < n; i++) {
  			arr[i] = x.nextInt();
  		}
  		return arr;
  	}
  
  	static int[] sortint(int a[]) {
  		ArrayList<Integer> al = new ArrayList<>();
  		for (int i : a) {
  			al.add(i);
  		}
  		Collections.sort(al);
  		for (int i = 0; i < a.length; i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static long[] sortlong(long a[]) {
  		ArrayList<Long> al = new ArrayList<>();
  		for (long i : a) {
  			al.add(i);
  		}
  		Collections.sort(al);
  		for (int i = 0; i < al.size(); i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static int pow(int x, int y) {
  		int result = 1;
  		while (y > 0) {
  			if (y % 2 == 0) {
  				x = x * x;
  				y = y / 2;
  			} else {
  				result = result * x;
  				y = y - 1;
  			}
  		}
  		return result;
  	}
  
  	static int[] revsort(int a[]) {
  		ArrayList<Integer> al = new ArrayList<>();
  		for (int i : a) {
  			al.add(i);
  		}
  		Collections.sort(al, Comparator.reverseOrder());
  		for (int i = 0; i < a.length; i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static int[] gcd(int a, int b, int ar[]) {
  		if (b == 0) {
  			ar[0] = a;
  			ar[1] = 1;
  			ar[2] = 0;
  			return ar;
  		}
  		ar = gcd(b, a % b, ar);
  		int t = ar[1];
  		ar[1] = ar[2];
  		ar[2] = t - (a / b) * ar[2];
  		return ar;
  	}
  
  	static boolean[] esieve(int n) {
  		boolean p[] = new boolean[n + 1];
  		Arrays.fill(p, true);
  		for (int i = 2; i * i <= n; i++) {
  			if (p[i] == true) {
  				for (int j = i * i; j <= n; j += i) {
  					p[j] = false;
  				}
  			}
  		}
  		return p;
  	}
  
  	static ArrayList<Integer> primes(int n) {
  		boolean p[] = new boolean[n + 1];
  		ArrayList<Integer> al = new ArrayList<>();
  		Arrays.fill(p, true);
  		int i = 0;
  		for (i = 2; i * i <= n; i++) {
  			if (p[i] == true) {
  				al.add(i);
  				for (int j = i * i; j <= n; j += i) {
  					p[j] = false;
  				}
  			}
  		}
  		for (i = i; i <= n; i++) {
  			if (p[i] == true) {
  				al.add(i);
  			}
  		}
  		return al;
  	}
  
  	static int etf(int n) {
  		int res = n;
  		for (int i = 2; i * i <= n; i++) {
  			if (n % i == 0) {
  				res /= i;
  				res *= (i - 1);
  				while (n % i == 0) {
  					n /= i;
  				}
  			}
  		}
  		if (n > 1) {
  			res /= n;
  			res *= (n - 1);
  		}
  		return res;
  	}
  
  	static int gcd(int a, int b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  
  	static long gcd(long a, long b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  }