#include <bits/stdc++.h>
using namespace std;
int DEBUGGING = 0;
const int INF = 1000000000;
const int MOD = 1000000007;
const double PI = 3.1415926535897932;
const double EPS = 1e-7;
long long gcdEx(long long a, long long b, long long *x, long long *y) {
  if (!a) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long modI(long long b, long long m) {
  long long x, y;
  gcdEx(b, m, &x, &y);
  return (x % m + m) % m;
}
long long modD(long long a, long long b) {
  return (modI(b, MOD) * (a % MOD)) % MOD;
}
long long modS(long long a, long long b) {
  return ((a % MOD) - (b % MOD) + MOD) % MOD;
}
long long modP(long long x, long long y) {
  long long r = 1;
  x %= MOD;
  while (y > 0) {
    if (y & 1) {
      r = (r * x) % MOD;
    }
    y = y >> 1;
    x = (x * x) % MOD;
  }
  return r;
}
long long modA(long long a, long long b) {
  return ((a % MOD) + (b % MOD)) % MOD;
}
long long modM(long long a, long long b) {
  return ((a % MOD) * (b % MOD)) % MOD;
}
int n, g, s, b, t, pt, mm;
int a[400005];
map<int, int> ps;
queue<int> gq, sq, bq;
void solve(int TEST_CASE) {
  g = 0, s = 0, b = 0;
  cin >> n;
  mm = n / 2;
  for (int i = 0; i < (n); ++i) cin >> a[i];
  ps.clear();
  auto itr = ps.find(0);
  for (int i = 0; i < (n); ++i) {
    itr = ps.find(a[i]);
    if (itr == ps.end()) {
      ps.insert({a[i], 1});
    } else {
      (itr->second)++;
    }
  }
  int tt = 0;
  vector<int> lol;
  for (auto it = ps.rbegin(); it != ps.rend(); it++)
    if (tt + (it->second) <= mm)
      lol.push_back(it->second), tt += (it->second);
    else
      break;
  if (lol.size() < 3) {
    cout << "0 0 0\n";
    return;
  }
  g = lol[0];
  for (int i = 0; (i < (lol.size())) && (g >= s); ++i)
    if (i) s += lol[i];
  b = tt - g - s;
  if ((g + s + b > mm) || g >= s || g >= b || !g || !s || !b) {
    if (DEBUGGING) cout << "IV " << g << " " << s << " " << b << "\n";
    cout << "0 0 0\n";
  } else {
    cout << g << " " << s << " " << b << "\n";
  }
}
int main(int argc, char *argv[]) {
  if (argc == 2 && argv[1][1] == 'v') DEBUGGING = 1;
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  int nTestCases = 1;
  cin >> nTestCases;
  for (int i = 1; i <= (nTestCases); ++i) solve(i);
  return 0;
}
