#include <bits/stdc++.h>
using namespace std;
namespace debug {
void err() { cout << endl; }
template <template <typename...> class T, typename t, typename... Args>
void err(T<t> a, Args... args) {
  for (auto x : a) cout << x << ' ';
  err(args...);
}
template <typename T, typename... Args>
void err(T a, Args... args) {
  cout << a << ' ';
  err(args...);
}
}  // namespace debug
using namespace debug;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long power(long long a, long long b) {
  if (b < 0) return 1;
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}
bool ispoweroftwo(long long x) { return (x && !(x & (x - 1))); }
long long GCD(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
const long long int inf = 1e9;
const long long INF = 1e18;
const long double pi = 3.141592653589793238;
long long int dx[] = {-1, 0, 1, 0};
long long int dy[] = {0, 1, 0, -1};
char MV[] = {'U', 'R', 'D', 'L'};
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> pp;
  map<long long int, long long int> mp;
  for (long long int i = 0; i < n; ++i) {
    long long int pi;
    cin >> pi;
    mp[-pi]++;
  }
  bool ok = 0;
  for (auto [i, j] : mp) pp.push_back(j);
  long long int g = pp[0];
  long long int i = 1;
  long long int s = 0, b = 0;
  while (s <= g && i < ((long long int)((pp).size()))) s += pp[i++];
  if (g < s) {
    while (b <= g && i < ((long long int)((pp).size()))) b += pp[i++];
    while ((g + s + b + pp[i]) <= n / 2 && i < ((long long int)((pp).size())))
      b += pp[i++];
    if (!g || !b || !s || s <= g || b <= g || (g + s + b) > n / 2) goto done;
    ok = 1;
    cout << g << ' ' << s << ' ' << b << '\n';
  }
done:
  if (!ok) cout << "0 0 0\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
