#include <bits/stdc++.h>
using namespace std;
int a[400005];
int b[400005];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    int i, j;
    for (i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    if (n < 6) {
      printf("0 0 0\n");
      continue;
    }
    for (i = n / 2; i >= 0; i--) {
      if (a[i] != a[i - 1]) break;
    }
    int num = i;
    for (i = 0; i < num; i++) b[i] = a[i];
    int now = 0;
    int jin = 0, yin = 0, tong = 0;
    for (i = 1; i < num; i++) {
      now++;
      if (a[i - 1] != a[i]) {
        jin = now;
        yin = now - 1;
        now = 0;
        break;
      }
    }
    for (i = i + jin; i < num; i++) {
      now++;
      if (a[i - 1] != a[i]) {
        yin += now;
        tong = num - i;
        break;
      }
    }
    if (jin >= yin || jin >= tong) {
      jin = 0, tong = 0, yin = 0;
    }
    printf("%d %d %d\n", jin, yin, tong);
  }
  return 0;
}
