#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;

bitset<5010> bad[5010];

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]);
    }
    
    vector<Int> B[2], BSum[2];
    for (int h = 0; h < 2; ++h) {
      B[h].resize(N);
      BSum[h].assign(N + 1, 0);
      for (int i = 0; i < N; ++i) {
        B[h][i] = (A[i] + ((h ^ i ^ 1) & 1)) / 2;
        BSum[h][i + 1] = BSum[h][i] + B[h][i];
      }
// cerr<<"B["<<h<<"] = "<<B[h]<<endl;
    }
    
    for (int l = 0; l <= N; ++l) bad[l].reset();
    for (int l = 0; l <= N; ++l) {
      bool b = false;
      Int now[2] = {};
      for (int i = l; i < N; ++i) {
        if (l <= i - 1) {
          // Hall for side 0 in [l, i)
          b = b || (now[0] > now[1] + min(B[0][i - 1], B[1][i]));
        }
        if (b) bad[l][i + 1] = true;
        for (int h = 0; h < 2; ++h) now[h] += B[h][i];
      }
    }
    for (int r = 0; r <= N; ++r) {
      bool b = false;
      Int now[2] = {};
      for (int i = r; --i >= 0; ) {
        if (i + 1 < r) {
          // Hall for side 0 in [i, r)
          b = b || (now[0] > now[1] + min(B[1][i], B[0][i + 1]));
        }
        if (b) bad[i][r] = true;
        for (int h = 0; h < 2; ++h) now[h] += B[h][i];
      }
    }
    
    int ans = 0;
    for (int l = 0; l <= N; ++l) for (int r = l + 1; r <= N; ++r) if (!bad[l][r]) {
      if (BSum[0][r] - BSum[0][l] == BSum[1][r] - BSum[1][l]) {
        ++ans;
      }
    }
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}