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: #include <bits/stdc++.h>
  using namespace std;
  void google(int t) { cout << "Case #" << t << ": "; }
  long long int pw(long long int a, long long int b) {
    if (b == 0) return 1;
    long long int t = pw(a, b / 2);
    if (b % 2)
      return ((a * t * t) % 1000000007);
    else
      return ((t * t) % 1000000007);
  }
  long long int gcd(long long int a, long long int b) {
    if (b == 0) {
      return a;
    }
    return gcd(b, a % b);
  }
  long long int lcm(long long int a, long long int b) {
    return (a / gcd(a, b)) * b;
  }
  long long int bintodec(string s, long long int n) {
    long long int ans = 0;
    for (long long int i = n - 1; i >= 0; i--) {
      if (s[i] == '1') {
        ans += pow(2, n - i - 1);
      }
    }
    return ans;
  }
  bool sortbysec(const pair<long long int, long long int> &a,
                 const pair<long long int, long long int> &b) {
    return (a.second < b.second);
  }
  bool isPrime(int n) {
    if (n <= 1) return false;
    for (int i = 2; i < n; i++)
      if (n % i == 0) return false;
    return true;
  }
  long long int factorial(long long int n) {
    if (n == 0) return 1;
    return n * factorial(n - 1);
  }
  void solve() {
    long long int n;
    cin >> n;
    long long int a[n];
    for (long long int i = 0; i < (long long int)n; i++) cin >> a[i];
    long long int ans = 1;
    for (long long int i = (long long int)(0); i < (long long int)(n); i++) {
      if (a[i] == 1 && i == 0)
        ans++;
      else if (a[i] == 1 && a[i - 1] == 1 && i >= 1)
        ans += 5;
      else if (a[i] == 1 && a[i - 1] == 0 && i >= 1)
        ans += 1;
      else if (a[i] == 0 && a[i - 1] == 0 && i >= 1) {
        cout << "-1" << endl;
        return;
      }
    }
    cout << ans << endl;
  }
  int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    long long int t;
    cin >> t;
    while (t--) {
      solve();
    }
    return 0;
  }
  