#include <bits/stdc++.h>
using namespace std;
int p[410000];
int T, n, g, s, b, ng, ns, nb, j;
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    g = s = b = 1;
    for (int i = 1; i <= n; ++i) scanf("%d", &p[i]);
    if (n < 12) {
      printf("0 0 0\n");
      continue;
    }
    ng = p[j = 1];
    while (j + 1 <= n && p[j + 1] == ng) ++j, ++g;
    if (j + 1 >= n) {
      printf("0 0 0\n");
      continue;
    }
    ns = p[j + 1];
    ++j;
    while (j + 1 <= n && (p[j + 1] == ns || s <= g)) ns = p[j + 1], ++j, ++s;
    if (j + 1 >= n) {
      printf("0 0 0\n");
      continue;
    }
    nb = p[j + 1];
    ++j;
    while (b + 1 + s + g <= n / 2 && j + 1 <= n) ++j, ++b;
    if (j + 1 <= n && p[j + 1] == nb) {
      printf("0 0 0\n");
      continue;
    }
    if (b + s + g > n / 2) {
      printf("0 0 0\n");
      continue;
    }
    if (g >= s || g >= b) {
      printf("0 0 0\n");
      continue;
    }
    printf("%d %d %d\n", g, s, b);
  }
}
