#include <bits/stdc++.h>
const int MAXN = 400000 + 5;
int a[MAXN], b[MAXN], c[MAXN];
void solve() {
  int N, i, cnt = 0;
  scanf("%d", &N);
  a[0] = -1;
  for (i = 1; i <= N; i++) {
    scanf("%d", a + i);
    if (a[i] != a[i - 1]) {
      b[++cnt]++;
    } else {
      b[cnt]++;
    }
  }
  if (N < 10 || cnt < 4) {
    printf("0 0 0\n");
    for (i = 1; i <= cnt; i++) {
      b[i] = 0;
    }
    return;
  }
  for (i = 1; i <= cnt; i++) {
    c[i] = c[i - 1] + b[i];
  }
  for (i = cnt; i && c[i] > (N >> 1); i--)
    ;
  int g = b[1], s = 0, br = 0, j;
  for (j = 2; j <= i && s <= g; j++) {
    s += b[j];
  }
  for (; j <= i; j++) {
    br += b[j];
  }
  for (i = 1; i <= cnt; i++) {
    b[i] = 0;
  }
  if (g < s && g < br) {
    printf("%d %d %d\n", g, s, br);
  } else {
    printf("0 0 0\n");
  }
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    solve();
  }
  return 0;
}
