#include <bits/stdc++.h>
const int N = 400010;
int s[N];
int cnt[N];
int sum[N];
int n, m;
int T;
int a, b, c;
inline bool check(int R) {
  if (R < 3) return false;
  if (sum[R] > n / 2) return false;
  int l = 2, r = R, ans = -1;
  while (l <= r) {
    int i = (l + r) >> 1;
    if (sum[i] - sum[1] > sum[1]) {
      ans = i;
      r = i - 1;
    } else {
      l = i + 1;
    }
  }
  if (ans == -1) return false;
  int ta = sum[1], tb = sum[ans] - sum[1], tc = sum[R] - sum[ans];
  if (ta < tb && ta < tc) {
    a = ta, b = tb, c = tc;
  }
  return false;
}
int main(void) {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    scanf("%d", &s[1]);
    m = 0;
    a = b = c = 0;
    cnt[++m] = 1;
    for (register int i = 2; i <= n; ++i) {
      scanf("%d", &s[i]);
      if (s[i] == s[i - 1]) {
        ++cnt[m];
      } else {
        cnt[++m] = 1;
      }
    }
    for (register int i = 1; i <= m; ++i) {
      sum[i] = sum[i - 1] + cnt[i];
    }
    for (register int i = 3; i <= m && sum[i] <= n / 2; ++i) {
      check(i);
    }
    printf("%d %d %d\n", a, b, c);
  }
  return 0;
}
