#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
const double eps = 1e-5;
int a[N], top = 0;
int bo[N], res[N];
int main() {
  int t, n, tmp, g, s, b;
  scanf("%d", &t);
  while (t--) {
    top = 1, a[0] = -1;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &tmp);
      if (tmp == a[top - 1]) {
        bo[top - 1]++;
      } else {
        a[top] = tmp;
        bo[top++] = 1;
      }
    }
    g = s = b = 0;
    int sum = 0, num = 0;
    for (int i = 0; i < top; i++) {
      if ((sum + bo[i]) * 2 <= n) {
        sum += bo[i];
        num++;
      } else
        break;
    }
    if (num < 3)
      printf("0 0 0\n");
    else {
      g = bo[1];
      for (int i = 2; i <= num; i++) {
        if (s <= g)
          s += bo[i];
        else
          break;
      }
      b = sum - g - s;
      if (g < s && g < b)
        printf("%d %d %d\n", g, s, b);
      else
        printf("0 0 0\n");
    }
  }
  return 0;
}
