#include <bits/stdc++.h>
using namespace std;
const long long maxn = 300010;
const long long MOD = 1e9 + 7;
const long long MOD2 = 998244353;
const long long INF = 2e9;
const long long LINF = 4e18;
long long n, m, x, y, l, r, k, q;
map<long long, long long> M, N;
vector<long long> a, b;
string s, ss;
set<long long, greater<long long> > S;
void solve() {
  cin >> n;
  vector<long long> a(n);
  M.clear();
  S.clear();
  for (auto &x : a) {
    cin >> x;
    M[x]++, S.insert(x);
  }
  if (S.size() < 3) {
    cout << "0 0 0\n";
    return;
  }
  auto itr = S.begin();
  long long x = *itr;
  itr++;
  long long y = *itr;
  itr++;
  long long z = *itr;
  if (M[x] + M[y] + M[z] > n / 2) {
    cout << "0 0 0\n";
    return;
  }
  long long sz = 0;
  while (sz < n / 2) {
    long long x = *prev(S.end());
    sz += M[x], S.erase(prev(S.end()));
  }
  vector<long long> v;
  for (auto u : S) v.push_back(M[u]);
  long long g = v[0], s = 0, b = 0;
  v.erase(v.begin());
  for (auto u : v) {
    if (s <= g)
      s += u;
    else
      b += u;
  }
  cout << g << " " << s << " " << b << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
