#include <bits/stdc++.h>
using namespace std;
int p[410000], num[410000], tot[410000];
int T, n, g, s, b, ng, ns, nb, j, cnt;
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &p[i]);
    cnt = 0;
    g = s = b = 1;
    for (int i = 1; i <= n; ++i) {
      num[++cnt] = p[i];
      tot[cnt] = 1;
      j = i;
      while (j + 1 <= n && p[j + 1] == num[cnt]) ++j, ++tot[cnt];
      i = j;
    }
    if (cnt <= 3) {
      puts("0 0 0");
      continue;
    }
    g = tot[1];
    s = tot[j = 2];
    while (j + 1 <= cnt && s <= g) ++j, s += tot[j];
    if (j + 1 > cnt) {
      puts("0 0 0");
      continue;
    }
    b = tot[++j];
    while (j + 1 <= cnt && (b <= g || g + tot[j + 1] + b + s <= n / 2))
      ++j, b += tot[j];
    if (g > s || g > b || g + s + b > n / 2) {
      puts("0 0 0");
      continue;
    }
    printf("%d %d %d\n", g, s, b);
  }
}
