#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
using pr = pair<T, U>;
template <typename T>
using vt = vector<T>;
template <class T>
bool cmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool cmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
inline namespace CP {
inline namespace Output {
template <class T>
void outv(vector<T> v, int add = 0, bool standard = 1) {
  for (T& i : v) (standard ? cout : cerr) << (i + add) << " ";
  cout << '\n';
}
template <class T>
void put(T output) {
  cout << output << '\n';
}
}  // namespace Output
class IO {
 public:
  void setIn(string second) { (void)!freopen(second.c_str(), "r", stdin); }
  void setOut(string second) { (void)!freopen(second.c_str(), "w", stdout); }
  void Input(int __use_input = 0) {
    if (!!__use_input && 0) {
      setIn("in" + to_string(__use_input) + ".txt");
    }
  }
  IO FastIO() {
    cin.tie(nullptr)->sync_with_stdio(0);
    return *this;
  }
  IO* SetIO(string __s = "", string __t = "") {
    cin.exceptions(cin.failbit);
    if ((int)(__t).size() && !0)
      setIn(__s), setOut(__t);
    else if ((int)(__s).size() && !0)
      setIn(__s + ".in"), setOut(__s + ".out");
    return this;
  }
};
}  // namespace CP
const int MX = (2e5 + 43);
int N;
int a[MX];
void test_case() {
  cin >> N;
  for (int i = (0); i < (N); ++i) cin >> a[i];
  int height = 1;
  for (int i = (0); i < (N); ++i) {
    if (i > 0 && !a[i] && !a[i - 1]) return void(put(-1));
    if (a[i]) {
      if (i > 0 && a[i - 1])
        height += 5;
      else
        height += 1;
    }
  }
  return void(put(height));
}
int main() {
  CP::IO().SetIO()->FastIO().Input(0);
  int Test_Cases = 1;
  cin >> Test_Cases;
  for (int tt = 1; tt <= Test_Cases; ++tt) {
    ;
    ;
    test_case();
  }
  return 0;
}

### Prompt

Create a solution in CPP for the following problem:

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;
template <typename T, typename U>
using pr = pair<T, U>;
template <typename T>
using vt = vector<T>;
template <class T>
bool cmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool cmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
inline namespace CP {
inline namespace Output {
template <class T>
void outv(vector<T> v, int add = 0, bool standard = 1) {
  for (T& i : v) (standard ? cout : cerr) << (i + add) << " ";
  cout << '\n';
}
template <class T>
void put(T output) {
  cout << output << '\n';
}
}  // namespace Output
class IO {
 public:
  void setIn(string second) { (void)!freopen(second.c_str(), "r", stdin); }
  void setOut(string second) { (void)!freopen(second.c_str(), "w", stdout); }
  void Input(int __use_input = 0) {
    if (!!__use_input && 0) {
      setIn("in" + to_string(__use_input) + ".txt");
    }
  }
  IO FastIO() {
    cin.tie(nullptr)->sync_with_stdio(0);
    return *this;
  }
  IO* SetIO(string __s = "", string __t = "") {
    cin.exceptions(cin.failbit);
    if ((int)(__t).size() && !0)
      setIn(__s), setOut(__t);
    else if ((int)(__s).size() && !0)
      setIn(__s + ".in"), setOut(__s + ".out");
    return this;
  }
};
}  // namespace CP
const int MX = (2e5 + 43);
int N;
int a[MX];
void test_case() {
  cin >> N;
  for (int i = (0); i < (N); ++i) cin >> a[i];
  int height = 1;
  for (int i = (0); i < (N); ++i) {
    if (i > 0 && !a[i] && !a[i - 1]) return void(put(-1));
    if (a[i]) {
      if (i > 0 && a[i - 1])
        height += 5;
      else
        height += 1;
    }
  }
  return void(put(height));
}
int main() {
  CP::IO().SetIO()->FastIO().Input(0);
  int Test_Cases = 1;
  cin >> Test_Cases;
  for (int tt = 1; tt <= Test_Cases; ++tt) {
    ;
    ;
    test_case();
  }
  return 0;
}

```