#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
vector<Int> A;

bool solve(int L, int R) {
  Int tot[2] = {};
  for (int i = L; i < R; ++i) {
    tot[0] += (A[i] + (~i & 1)) / 2;
    tot[1] += (A[i] + ( i & 1)) / 2;
  }
  if (tot[0] != tot[1]) return false;
  for (int l = L; l < R; ++l) for (int r = l + 1; r <= R; ++r) if (l == L || r == R) {
    auto inside = [&](int i) -> bool {
      return (l <= i && i < r);
    };
    Int ss[2] = {};
    for (int i = L; i < R; ++i) if (inside(i)) {
      ss[0] += (A[i] + (~i & 1)) / 2;
    }
    for (int i = L; i < R; ++i) {
      if (!(i & 1)) {
        Int a = 0;
        if (i - 1 >= L && inside(i - 1)) chmax(a, A[i - 1] / 2 * 2);
        if (i + 1 <  R && inside(i + 1)) chmax(a, A[i + 1] / 2 * 2);
        if (inside(i)) chmax(a, A[i]);
        chmin(a, A[i]);
        ss[1] += a / 2;
      } else {
        Int a = 0;
        if (i - 1 >= L && inside(i - 1)) chmax(a, (A[i - 1] + 1) / 2 * 2 - 1);
        if (i + 1 <  R && inside(i + 1)) chmax(a, (A[i + 1] + 1) / 2 * 2 - 1);
        if (inside(i)) chmax(a, A[i]);
        chmin(a, A[i]);
        ss[1] += (a + 1) / 2;
      }
    }
    if (ss[0] > ss[1]) return false;
  }
  return true;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    int ans = 0;
    for (int l = 0; l <= N; ++l) for (int r = l + 1; r <= N; ++r) {
      if (solve(l, r)) {
// cerr<<l<<" "<<r<<endl;
        ++ans;
      }
    }
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}