#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  map<int, int> mp;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    x *= -1;
    mp[x]++;
  }
  int pos = n / 2;
  int g = mp.begin()->second, b = 0, s = 0;
  mp.erase(mp.begin());
  while (!mp.empty() && g >= s) {
    s += mp.begin()->second;
    mp.erase(mp.begin());
  }
  while (!mp.empty() && g >= b) {
    b += mp.begin()->second;
    mp.erase(mp.begin());
  }
  while (!mp.empty() && b + s + g < pos) {
    if (mp.begin()->second + b + s + g <= pos) {
      b += mp.begin()->second;
    } else {
      break;
    }
    mp.erase(mp.begin());
  }
  if (g < s && g < b && g + s + b <= pos && g > 0 && s > 0 & b > 0) {
    cout << g << " " << s << " " << b;
  } else {
    cout << "0 0 0";
  }
  cout << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
