#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <bitset>

using namespace std;
using ll = long long;
const int N = 1e6 + 5;

int n, a[N];

void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  ll ones = 0, posi = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > 0) posi++;
    if (a[i] == 1) ones++;
  }

  ll nz = n - posi;
  posi -= ones;

  ll ans = nz * posi + ones * (n - ones);
  printf("%lld\n", ans);
}

int main() {
  ios::sync_with_stdio(false); cin.tie(0);

  int t; cin >> t; while (t--)
    solve();

  return 0;  
}