#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  int i, j, k;
  for (i = 0; i < n; i++) cin >> p[i];
  int m = n / 2;
  int a[m];
  for (i = 0; i < m; i++) a[i] = p[i];
  if (a[m - 1] == p[m]) {
    i = m - 1;
    while (a[i] == a[i - 1]) {
      a[i] = 0;
      m--;
      i--;
    }
    a[i - 1] = 0;
    m--;
  }
  int g = 0, s = 0, b = 0;
  for (i = 0; i < m - 1; i++) {
    if (a[i] == a[i + 1])
      g++;
    else
      break;
  }
  g++;
  i++;
  while (s <= g) {
    for (; i < m - 1; i++)
      if (a[i] == a[i + 1])
        s++;
      else
        break;
    s++;
    i++;
    if (i >= m - 1) break;
  }
  b = m - (s + g);
  if (g <= 0 || s <= 0 || b <= 0 || g > s || g > b)
    cout << "0 0 0"
         << "\n";
  else
    cout << g << " " << s << " " << b << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  clock_t tStart = clock();
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
