#include <bits/stdc++.h>
using namespace std;
void test_case() {
  int n;
  cin >> n;
  ;
  vector<int> p(n + 1);
  vector<int> cnt;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  p[n] = -1;
  int curr_p = p[0], c = 0;
  for (int i = 0; i < n + 1; i++) {
    if (p[i] == curr_p) {
      c++;
    } else {
      cnt.push_back(c);
      curr_p = p[i];
      i--;
      c = 0;
    }
  }
  int i, sum = 0;
  for (i = 0; i < cnt.size(); i++) {
    sum += cnt[i];
    if (2 * sum > n) {
      break;
    }
  }
  i--;
  int g = cnt[0], s = 0, b = 0, j;
  for (j = 1; j < i; j++) {
    s += cnt[j];
    if (s > g) {
      break;
    }
  }
  for (int k = j + 1; k <= i; k++) {
    b += cnt[k];
  }
  if (s < g || b < g) {
    cout << 0 << ' ' << 0 << ' ' << 0 << endl;
  } else {
    cout << g << ' ' << s << ' ' << b << endl;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    test_case();
  }
  cerr << endl
       << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
