#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int xorTillN(int n) {
  if (n % 4 == 0) {
    return n;
  } else if (n % 4 == 1) {
    return 1;
  } else if (n % 4 == 2) {
    return n + 1;
  } else if (n % 4 == 3) {
    return 0;
  }
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
void fast() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  int n;
  cin >> n;
  int arr[n];
  int h = 1;
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  for (long long i = 0; i < n; i++) {
    if (i != 0) {
      if (arr[i] == 0 && arr[i - 1] == 0) {
        cout << -1 << endl;
        return;
      } else if (arr[i] == 0 && arr[i - 1] == 0) {
        h = h;
      } else if (arr[i] == 1 && arr[i - 1] == 1) {
        h += 5;
      } else if (arr[i] == 1 && arr[i - 1] == 0) {
        h++;
      }
    }
  }
  if (arr[0] == 1) {
    h++;
  }
  cout << h << endl;
}
int main() {
  fast();
  {
    int t;
    cin >> t;
    while (t--) {
      solve();
    }
    return 0;
  }
}

### Prompt

In CPP, your task is to solve 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;
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int xorTillN(int n) {
  if (n % 4 == 0) {
    return n;
  } else if (n % 4 == 1) {
    return 1;
  } else if (n % 4 == 2) {
    return n + 1;
  } else if (n % 4 == 3) {
    return 0;
  }
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
void fast() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  int n;
  cin >> n;
  int arr[n];
  int h = 1;
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  for (long long i = 0; i < n; i++) {
    if (i != 0) {
      if (arr[i] == 0 && arr[i - 1] == 0) {
        cout << -1 << endl;
        return;
      } else if (arr[i] == 0 && arr[i - 1] == 0) {
        h = h;
      } else if (arr[i] == 1 && arr[i - 1] == 1) {
        h += 5;
      } else if (arr[i] == 1 && arr[i - 1] == 0) {
        h++;
      }
    }
  }
  if (arr[0] == 1) {
    h++;
  }
  cout << h << endl;
}
int main() {
  fast();
  {
    int t;
    cin >> t;
    while (t--) {
      solve();
    }
    return 0;
  }
}

```