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