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: /*
  Problem #
  */
  
  import java.io.FileInputStream;
  import java.io.IOException;
  import java.io.InputStream;
  
  public class LifeOfFlower {
  	
  	public static void main(String[] args) throws IOException {
  		FastIO in = new FastIO(System.in);
  		
  		int t = in.nextInt();
  here:		while (t-- > 0) {
  			int n = in.nextInt();
  			int[] a = new int[n];
  			int h = 1;
  			
  			for (int i = 0; i < n; i++) a[i] = in.nextInt();
  			
  			if (a[0] == 1) h++;
  			for (int i = 1; i < n; i++) {
  				if (a[i] == 0 && a[i-1] == 0) {
  					System.out.println(-1);
  					continue here;
  				} else if (a[i] == 1 && a[i-1] == 1) {
  					h += 5;
  				} else if (a[i] == 1) h++;
  			}
  			System.out.println(h);
  		}
  		
  		in.close();
  	}
  	
  	public static class FastIO {
  		private InputStream dis;
  		private byte[] buffer = new byte[1 << 17];
  		private int pointer = 0;
  	
  		public FastIO(String fileName) throws IOException {
  			dis = new FileInputStream(fileName);
  		}
  	
  		public FastIO(InputStream is) throws IOException {
  			dis = is;
  		}
  	
  		public int nextInt() throws IOException {
  			int ret = 0;
  			byte b;
  			
  			do {
  				b = nextByte();
  			} while (b <= ' ');
  			
  			boolean negative = false;
  			if (b == '-') {
  				negative = true;
  				b = nextByte();
  			}
  			
  			while (b >= '0' && b <= '9') {
  				ret = 10 * ret + b - '0';
  				b = nextByte();
  			}
  	
  			return (negative) ? -ret : ret;
  		}
  	
  		public long nextLong() throws IOException {
  			long ret = 0;
  			byte b;
  			
  			do {
  				b = nextByte();
  			} while (b <= ' ');
  			
  			boolean negative = false;
  			if (b == '-') {
  				negative = true;
  				b = nextByte();
  			}
  			
  			while (b >= '0' && b <= '9') {
  				ret = 10 * ret + b - '0';
  				b = nextByte();
  			}
  			
  			return (negative) ? -ret : ret;
  		}
  	
  		public byte nextByte() throws IOException {
  			if (pointer == buffer.length) {
  				dis.read(buffer, 0, buffer.length);
  				pointer = 0;
  			}
  			return buffer[pointer++];
  		}
  	
  		public String next() throws IOException {
  			StringBuffer ret = new StringBuffer();
  			byte b;
  			
  			do {
  				b = nextByte();
  			} while (b <= ' ');
  			
  			while (b > ' ') {
  				ret.appendCodePoint(b);
  				b = nextByte();
  			}
  	
  			return ret.toString();
  		}
  	
  		public void close() throws IOException {
  			dis.close();
  		}
  	}
  }