#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int T, n, p[N];
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    int l = n / 2;
    p[0] = -1;
    p[n + 1] = -1;
    for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
    if (p[l] == p[l + 1]) {
      while (p[l] == p[l - 1]) l--;
      l--;
    }
    int g = 1, b = l;
    while (p[g] == p[g + 1]) g++;
    while (l - b + 1 <= g) b--;
    if (b <= 0) {
      puts("0 0 0");
      continue;
    }
    while (p[b - 1] == p[b]) b--;
    int G = g, B = l - b + 1, S = l - G - B;
    if (S > G && B > G && G > 0)
      printf("%d %d %d\n", G, S, B);
    else
      puts("0 0 0");
  }
  return 0;
}
