#include <bits/stdc++.h>
using namespace std;
const int M = 4e5 + 1;
int a[M];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    int j = 0;
    int frq = 0;
    int last = -1;
    for (int i = 0; i < n; i++) {
      int v;
      scanf("%d", &v);
      if (!i) {
        last = v;
        frq++;
      } else if (last != v) {
        a[j] = frq;
        j++;
        frq = 1;
        last = v;
      } else
        frq++;
      if (i + 1 == n) {
        a[j] = frq;
        j++;
      }
    }
    int x, y, z;
    x = y = z = 0;
    x = a[0];
    int sum = x;
    int mx = n / 2;
    for (int i = 1; sum < mx && i < j; i++) {
      if (y < x) {
        sum += a[i];
        y += a[i];
      } else {
        if (sum + a[i] <= mx) {
          sum += a[i];
          z += a[i];
        } else
          break;
      }
    }
    if (z > x && y > x && x + y + z <= mx && x && y && z) {
      printf("%d %d %d\n", x, y, z);
    } else
      printf("0 0 0\n");
  }
}
