#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
int n, T, p[maxn];
int main() {
  cin >> T;
  while (T--) {
    int g = 0, s = 0, b = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
    if (n < 6) {
      printf("%d %d %d\n", g, s, b);
      continue;
    }
    vector<int> num;
    {
      int tmp = p[1];
      int x = 0;
      for (int i = 1; i <= n; i++) {
        if (tmp == p[i]) x++;
        if (tmp != p[i]) {
          num.push_back(x);
          tmp = p[i];
          x = 1;
        }
      }
      num.push_back(x);
    }
    int sum = 0, tot;
    for (int i = 0; i < num.size(); i++) {
      sum += num[i];
      if (sum > n / 2) {
        tot = i;
        break;
      }
    }
    if (tot < 3) {
      printf("%d %d %d\n", g, s, b);
      continue;
    }
    sum = 0;
    g = num[0];
    for (int i = 1; i < tot; i++) sum += num[i];
    if (sum < g * 2) {
      printf("0 0 0\n");
      continue;
    }
    int tmp;
    for (int i = 1; i < tot; i++) {
      s += num[i];
      if (s > g) {
        tmp = i + 1;
        break;
      }
    }
    for (int i = tmp; i < tot; i++) b += num[i];
    if (s < g || b < g) {
      printf("0 0 0\n");
      continue;
    }
    printf("%d %d %d\n", g, s, b);
  }
  return 0;
}
