#include <bits/stdc++.h>
using namespace std;
void work() {
  vector<int> vt;
  int n;
  scanf("%d", &n);
  int last, cnt = 0, a;
  scanf("%d", &a);
  last = a;
  for (int i = 1; i < n; ++i) {
    scanf("%d", &a);
    if (a == last) {
      cnt++;
    } else {
      last = a;
      vt.push_back(cnt + 1);
      cnt = 0;
    }
  }
  vt.push_back(cnt + 1);
  if (n < 10) {
    printf("0 0 0\n");
    return;
  }
  int mx = n / 2, g = vt[0], s = 0, b = 0, p = 1, sum = vt[0];
  int len = vt.size();
  while (s <= g && p < len) {
    s += vt[p];
    ++p;
  }
  sum += s;
  while (p < len && sum + vt[p] <= mx) {
    b += vt[p];
    sum += vt[p];
    p++;
  }
  if (s > g && b > g)
    printf("%d %d %d\n", g, s, b);
  else
    printf("0 0 0\n");
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    work();
  }
  return 0;
}
