#include <bits/stdc++.h>
using namespace std;
void Fastio() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long fact[1000006], inv[1000006];
long long fp(long long base, long long exp) {
  if (exp == 0) return 1;
  long long ans = fp(base, exp / 2);
  ans = (ans * ans) % 998244353;
  if (exp % 2 != 0) ans = (ans * (base % 998244353)) % 998244353;
  return ans;
}
void calcFacAndInv(long long n) {
  fact[0] = inv[0] = 1;
  for (long long i = 1; i <= n; i++) {
    fact[i] = (i * fact[i - 1]);
    inv[i] = fp(fact[i], 998244353 - 2);
  }
}
long long ncr(long long n, long long r) {
  return ((fact[n] * inv[r]) % 998244353 * inv[n - r]) % 998244353;
}
long long npr(long long n, long long r) {
  return (fact[n] * inv[n - r]) % 998244353;
}
long double NCR(int n, int m) {
  long double res = 1;
  m = min(m, n - m);
  for (int i = 0; i < m; i++) {
    res = res * (n - i) / (i + 1);
  }
  return res;
}
long long tol(string a) {
  long long res = 0;
  while (a[0] == '0') {
    a.erase(a.begin());
  }
  if (a == "") a = "0";
  for (int i = 0; i < a.size(); i++) {
    res *= 10;
    res += a[i] - '0';
  }
  return res;
}
int check(string a, string b) {
  for (int i = 0; i < a.size(); i++) {
    if (a[i] > b[i]) return 1;
    if (b[i] > a[i]) return -1;
  }
  return 0;
}
int main() {
  Fastio();
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    map<int, int> mp;
    set<int> s;
    int arr[n];
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      arr[i] = x;
      if (i < n / 2) s.insert(x);
      mp[x]++;
    }
    if (s.empty()) {
      cout << "0 0 0\n";
      continue;
    }
    set<int>::iterator it = s.begin();
    if (arr[n / 2] == *it) s.erase(it);
    if (s.size() < 3) {
      cout << "0 0 0\n";
      continue;
    }
    it = s.end();
    it--;
    int g = mp[*it], si = 0;
    long long sum = 0;
    s.erase(it);
    for (it = s.begin(); it != s.end(); it++) {
      sum += mp[*it];
    }
    it = s.end();
    it--;
    while (!s.empty()) {
      it = s.end();
      it--;
      si += mp[*it];
      if (g < si && g < sum - si) {
        cout << g << " " << si << " " << sum - si << '\n';
        goto finish;
      }
      s.erase(*it);
    }
    cout << "0 0 0\n";
  finish:;
  }
  return 0;
}
