#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  map<int, int> cnt;
  for (int i = 1; i <= n; i++) {
    int p;
    cin >> p;
    cnt[-p]++;
  }
  vector<int> c;
  for (auto x : cnt) c.push_back(x.second);
  int d = (int)(c.size());
  int g = c[0];
  int s = 0, i1 = 1;
  while (s <= g && i1 < d) {
    s += c[i1];
    i1++;
  }
  int b = 0;
  while (2 * (g + s + b) <= n && i1 < d) {
    b += c[i1];
    i1++;
  }
  b -= c[i1 - 1];
  if (g > 0 && s > 0 && b > 0 && g < s && g < b && (g + s + b) <= n / 2) {
    cout << g << ' ' << s << ' ' << b << endl;
    return;
  }
  cout << "0 0 0" << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
