#include <bits/stdc++.h>
using namespace std;
const int maxN = 4e5 + 5;
int t, n, a[maxN];
int g, s, b, m, p;
void input() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
}
void solve() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  m = n / 2;
  while (a[m] == a[m + 1]) m--;
  if (m == 0) {
    cout << "0 0 0\n";
    return;
  }
  g = 1;
  while (a[g] == a[g + 1]) g++;
  if (g == m) {
    cout << "0 0 0\n";
    return;
  }
  p = g + 1;
  while ((a[p] == a[p + 1] || p - g <= g) && p < m) p++;
  if (p == m || m - p <= g) {
    cout << "0 0 0\n";
    return;
  }
  s = p - g;
  b = m - p;
  cout << g << " " << s << " " << b << "\n";
}
int main() {
  input();
  while (t--) solve();
}
