#include <bits/stdc++.h>
using namespace std;
int a[500000], N, n, g, s, b;
bool ff(int x) {
  int y;
  for (int i = 0; i < x; i++) {
    if (a[i] == a[0])
      g++;
    else {
      if (s <= g || a[i] == y) {
        s++;
        y = a[i];
      } else {
        b++;
      }
    }
  }
  if (g >= b || g >= s)
    return 0;
  else
    return 1;
}
void fff() {
  int m = n / 2;
  g = s = b = 0;
  while (m > 1 && a[m - 1] == a[m]) {
    m--;
  }
  if (ff(m))
    printf("%d %d %d\n", g, s, b);
  else
    printf("0 0 0\n");
}
int main() {
  scanf("%d", &N);
  while (N--) {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    fff();
  }
  return 0;
}
