#include <bits/stdc++.h>
using namespace std;
int T;
int N;
int A[400401];
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &N);
    for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
    int i = 1, j = 1, k = 1;
    while (i < N && A[i + 1] == A[i]) i++;
    j = max(j, i + i + 1);
    while (j < N && A[j + 1] == A[j]) j++;
    k = max(k, j + i + 1);
    while (k < N && A[k + 1] == A[k]) k++;
    if (k > N / 2) {
      printf("%d %d %d\n", 0, 0, 0);
      continue;
    }
    for (int p = 1; p <= N / 2; p++)
      if (p == N || A[p] != A[p + 1]) k = max(k, p);
    printf("%d %d %d\n", i, j - i, k - j);
  }
  return 0;
}
