#include <bits/stdc++.h>
using namespace std;
int n;
int a[500005], b[500005], c[500005];
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b + 1, b + n + 1);
  int len = unique(b + 1, b + n + 1) - b - 1, mx = 0;
  for (int i = 1; i <= n; i++) {
    a[i] = lower_bound(b + 1, b + len + 1, a[i]) - b;
    mx = max(mx, a[i]);
    c[a[i]]++;
  }
  int s1 = c[mx], s2 = 0, s3 = 0, i;
  for (i = mx - 1; i >= 1; i--) {
    s2 += c[i];
    if (s2 > s1) break;
  }
  for (int j = i - 1; j >= 1; j--) {
    s3 += c[j];
    if (s3 > s1) {
      i = j - 1;
      break;
    }
  }
  if (s1 + s2 + s3 > n / 2)
    puts("0 0 0");
  else {
    for (int j = i; j >= 1; j--) {
      if (s1 + s2 + s3 + c[j] > n / 2) break;
      s3 += c[j];
    }
    printf("%d %d %d\n", s1, s2, s3);
  }
  for (int i = 1; i <= mx; i++) {
    c[i] = 0;
  }
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
