#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
int t;
int n, p[400400];
void solve() {
  scanf("%d", &n);
  int last = -1, cnt = 0;
  vector<int> a;
  for (int i = 0; i < n; i++) {
    scanf("%d", p + i);
    if (p[i] != last) {
      if (cnt) a.push_back(cnt);
      last = p[i];
      cnt = 1;
    } else
      cnt++;
  }
  a.push_back(cnt);
  if (a.size() < 3) {
    printf("0 0 0\n");
    return;
  }
  int j = 1;
  int second = 0;
  while (j < a.size() && a[0] >= second) second += a[j++];
  int b = 0;
  while (j < a.size() && a[0] >= b) b += a[j++];
  if (2 * (a[0] + second + b) > n || a[0] >= second || a[0] >= b) {
    printf("0 0 0\n");
    return;
  }
  while (j < a.size() && (a[0] + second + b + a[j]) * 2 <= n) {
    b += a[j++];
  }
  printf("%d %d %d\n", a[0], second, b);
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
  return 0;
}
