#include <bits/stdc++.h>
using namespace std;
int a[404040];
inline void solve() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  int N = 0;
  for (int i = 1, j = 1; i <= n; i = j) {
    for (; j <= n && a[i] == a[j]; j++)
      ;
    a[++N] = j - i;
  }
  int s2 = 0, i2 = 2;
  for (; i2 <= N && s2 <= a[1]; i2++) s2 += a[i2];
  i2--;
  int sum = a[1] + s2;
  int s3 = 0, i3 = i2 + 1;
  for (; i3 <= N && (sum + a[i3]) * 2 <= n; i3++) sum += a[i3], s3 += a[i3];
  i3--;
  if (a[1] < s3)
    printf("%d %d %d\n", a[1], s2, s3);
  else
    puts("0 0 0");
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
}
