#include <bits/stdc++.h>
using namespace std;
const int mx = 4e5 + 5;
char str[mx];
int p[mx];
int pos[mx];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &p[i]);
    }
    p[n + 1] = -1;
    int a = -1, b = -1, c = -1;
    for (int i = 1; i <= n; i++) {
      if (p[i] != p[1]) {
        a = i - 1;
        break;
      }
    }
    for (int i = a + 1; i <= n; i++) {
      if (i - a > a && p[i + 1] != p[i]) {
        b = i;
        break;
      }
    }
    for (int i = b + 1; i <= n; i++) {
      if (i - b > a && p[i + 1] != p[i]) {
        c = i;
        break;
      }
    }
    if (a > 0 && b > 0 && c > 0 && a < b - a && a < c - b && c <= n / 2)
      printf("%d %d %d\n", a, b - a, c - b);
    else
      printf("0 0 0\n");
  }
  return 0;
}
