#include <bits/stdc++.h>
using namespace std;
long long n, a[4000002], m;
bool cmp(long long a, long long b) { return a > b; }
void nhap() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  sort(a + 1, a + n + 1, cmp);
}
void sol() {
  long long o = 1;
  while (o < n && a[o] == a[o + 1]) ++o;
  if (o > n / 2) {
    cout << "0 0 0\n";
    return;
  }
  long long k = n / 2;
  while (k > 0 && a[k] == a[k + 1]) --k;
  for (int i = o + 1; i <= k; ++i) {
    if (a[i] == a[i + 1]) continue;
    long long s = i - o;
    if (s > o && k - i > o) {
      cout << o << " " << s << " " << k - i << "\n";
      return;
    }
  }
  cout << "0 0 0\n";
}
int main(int argc, const char* argv[]) {
  long long t;
  cin >> t;
  for (int i = 1; i <= t; ++i) {
    nhap();
    sol();
  }
  return 0;
}
