#include <bits/stdc++.h>
using namespace std;
int A[400000];
int main() {
  int T, N, m, g, s, i;
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &N);
    for (i = 0; i < N; ++i) scanf("%d", &A[i]);
    if (N < 3) {
      printf("0 0 0\n");
      continue;
    }
    for (m = N / 2 - 1; m && A[m] == A[m + 1]; --m)
      ;
    if (m < 3) {
      printf("0 0 0\n");
      continue;
    }
    for (g = 0; g < m && A[g] == A[g + 1]; ++g)
      ;
    for (s = g * 2 + 2; s < m && A[s] == A[s + 1]; ++s)
      ;
    if (m - s <= g) {
      printf("0 0 0\n");
      continue;
    }
    printf("%d %d %d\n", g + 1, s - g, m - s);
  }
  return 0;
}
