#include <bits/stdc++.h>
using namespace std;
map<long long, long long> fib;
bool isprime(int n) {
  int cnt = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      cnt += 2;
      if (i * i == n) {
        cnt--;
      }
    }
  }
  if (cnt == 2)
    return true;
  else
    return false;
}
int XOR(int n) {
  int ans;
  if (n % 4 == 0) {
    ans = 0;
  } else if (n % 2 == 0) {
    ans = 1;
  } else {
    if (abs(n - 1) % 4 == 0) {
      ans = n - 1;
    } else {
      ans = n;
    }
  }
  return ans;
}
bool isPowerOfTwo(long long n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int height = 1;
  int flag = -1;
  if (v[0] == 1) {
    flag = 1;
    height += 1;
  } else {
    flag = 0;
  }
  for (int i = 1; i < n; i++) {
    if (flag == 0 && v[i] == 0) {
      cout << -1 << endl;
      return;
    } else if (flag == 1 && v[i] == 1) {
      height += 5;
    } else if (v[i] == 1) {
      height += 1;
    }
    flag = v[i];
  }
  cout << height << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> fib;
bool isprime(int n) {
  int cnt = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      cnt += 2;
      if (i * i == n) {
        cnt--;
      }
    }
  }
  if (cnt == 2)
    return true;
  else
    return false;
}
int XOR(int n) {
  int ans;
  if (n % 4 == 0) {
    ans = 0;
  } else if (n % 2 == 0) {
    ans = 1;
  } else {
    if (abs(n - 1) % 4 == 0) {
      ans = n - 1;
    } else {
      ans = n;
    }
  }
  return ans;
}
bool isPowerOfTwo(long long n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int height = 1;
  int flag = -1;
  if (v[0] == 1) {
    flag = 1;
    height += 1;
  } else {
    flag = 0;
  }
  for (int i = 1; i < n; i++) {
    if (flag == 0 && v[i] == 0) {
      cout << -1 << endl;
      return;
    } else if (flag == 1 && v[i] == 1) {
      height += 5;
    } else if (v[i] == 1) {
      height += 1;
    }
    flag = v[i];
  }
  cout << height << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

```