#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> arr;
void solve() {
  cin >> n;
  map<long long, long long> mp;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    mp[x]++;
  }
  auto itr = mp.rbegin();
  long long g = itr->second;
  itr++;
  long long b = 0, s = 0;
  for (; s <= g && itr != mp.rend(); itr++) {
    s += itr->second;
  }
  for (; itr != mp.rend(); itr++) {
    if (g + s + b + itr->second > n / 2) {
      break;
    } else {
      b += itr->second;
    }
  }
  if (g == 0 || s == 0 || b == 0 || s < g || b < g) {
    cout << "0 0 0";
  } else {
    cout << g << " " << s << " " << b;
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
