#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, g = 0, s = 0, b = 0, i, tm;
  cin >> n;
  map<long long, long long> mpp;
  for (i = 0; i < n; i++) {
    cin >> tm;
    mpp[-tm]++;
  }
  auto it = mpp.begin();
  g = it->second;
  it++;
  for (; it != mpp.end(); it++) {
    s += it->second;
    if (s > g) {
      it++;
      break;
    }
  }
  for (; it != mpp.end(); it++) {
    b += it->second;
    if (g + s + b > n / 2) {
      b -= it->second;
      break;
    }
  }
  if (g > 0 && b > 0 && s > 0 && g < s && g < b && (g + s + b) <= n / 2)
    cout << g << " " << s << " " << b;
  else
    cout << "0 0 0";
  cout << "\n";
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  srand(time(NULL));
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
