#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
  if (b >= (MOD - 1)) b %= (MOD - 1);
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long mpow(long long a, long long b, long long p) {
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2, p);
  t1 *= t1;
  t1 %= p;
  if (b % 2) t1 *= a;
  t1 %= p;
  return t1;
}
long long modinverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
void solve() {
  int n;
  cin >> n;
  vector<int> vls(n);
  for (long long i = 0; i < n; i++) {
    cin >> vls[i];
  }
  vector<int> ot;
  for (long long i = 0; i < n; i++) {
    int j = i;
    while (j < n && vls[i] == vls[j]) {
      j++;
    }
    ot.push_back(j - i);
    i = j - 1;
  }
  int g = 0, s = 0, b = 0;
  int curr = 1;
  g += ot[0];
  while (curr < ot.size() && s <= g) {
    s += ot[curr];
    curr++;
  }
  while (curr < ot.size() && b <= g) {
    b += ot[curr];
    curr++;
  }
  while (curr < ot.size() && g + s + b <= n / 2) {
    if (g + s + b + ot[curr] > n / 2) {
      break;
    }
    b += ot[curr];
    curr++;
  }
  bool flg = 1;
  if (g + s + b > n / 2) {
    flg = 0;
  }
  if (g >= s || g >= b || g == 0 || s == 0 || b == 0) {
    flg = 0;
  }
  if (!flg) {
    cout << 0 << " " << 0 << " " << 0 << "\n";
  } else {
    cout << g << " " << s << " " << b << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  cin >> t;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
