#include <bits/stdc++.h>
using namespace std;
template <class T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
void solve() {
  long long n;
  cin >> n;
  long long p[400005];
  for (auto(i) = 1; i < n + 1; i++) cin >> p[i];
  if (n <= 5) {
    cout << "0 0 0\n";
    return;
  }
  long long mx = n / 2;
  const long long element = p[mx];
  if (p[mx + 1] == element) {
    for (auto(i) = 1; i < n + 1; i++) {
      if (p[i] == element)
        break;
      else
        mx = i;
    }
  }
  long long idx = 1;
  const long long goldGroup = p[1];
  long long g = 0;
  while (p[idx] == goldGroup) {
    ++idx;
    ++g;
  }
  if (idx >= mx) {
    cout << "0 0 0\n";
    return;
  }
  long long silverGroup = p[idx];
  long long s = 0;
  while (g >= s or p[idx] == silverGroup) {
    silverGroup = p[idx];
    ++idx;
    s++;
  }
  if (idx >= mx) {
    cout << "0 0 0\n";
    return;
  }
  long long b = mx - s - g;
  if (g >= b) {
    cout << "0 0 0\n";
    return;
  }
  cout << g << ' ' << s << ' ' << b << '\n';
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
