#include <bits/stdc++.h>
void solve(void);
using namespace std;
signed main() {
  ios_base::sync_with_stdio(false);
  long long int t;
  cin >> t;
  while (t--) solve();
}
void solve() {
  long long int n;
  cin >> n;
  long long int t = n / 2;
  map<long long int, long long int, greater<long long int> > m;
  for (long long int i = 0; i < n; i++) {
    long long int k;
    cin >> k;
    m[k]++;
  }
  vector<long long int> v;
  for (auto it = m.begin(); it != m.end(); it++) {
    v.push_back(it->second);
  }
  if (n < 10) {
    cout << "0 0 0" << endl;
    return;
  }
  if (v[0] >= (t / 3)) {
    cout << "0 0 0" << endl;
    return;
  }
  long long int g = 0, s = 0, b = 0;
  g = v[0];
  t = t - g;
  long long int k;
  for (long long int i = 1; i < v.size(); i++) {
    s = s + v[i];
    if (s > g) {
      k = i;
      break;
    }
    if (s >= t) {
      cout << "0 0 0" << endl;
      return;
    }
  }
  t = t - s;
  for (long long int i = k + 1; i < v.size() - 1; i++) {
    b = b + v[i];
    if (b + v[i + 1] > t && b > g) {
      break;
    }
    if (b > t) {
      cout << "0 0 0" << endl;
      return;
    }
  }
  cout << g << " " << s << " " << b << endl;
}
