#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  int l = 0, r = n - 1;
  while (v[l] == 0) l++;
  while (v[l] == 1) l++;
  while (v[r] == 0) r--;
  while (v[r] == 1) r--;
  if (r < l) {
    cout << 0 << "\n";
    return;
  }
  int res = 0;
  for (int i = l; i <= r; i++) {
    if (v[i] == 0) res++;
  }
  cout << res << "\n";
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
