#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[1000004], b[1000004];
void exe() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  a[n] = -1;
  int x = 0, y = -1, z = -1, x1 = 0, y1 = 0, z1 = 0;
  int zp = n / 2 - 1;
  while (zp >= 0 and a[zp + 1] == a[zp]) zp--;
  while (true) {
    while (x < n and a[x] == a[x + 1]) x++;
    if (y == -1) y = x + 1;
    while (y < n and (a[y] == a[y + 1] or y - x <= x + 1)) y++;
    if (z == -1) z = y + 1;
    while (z < n and (a[z] == a[z + 1] or z - y <= x + 1)) z++;
    if ((z + 1) * 2 <= n) {
      x1 = x + 1, y1 = y - x, z1 = zp - y;
    }
    break;
  }
  cout << x1 << ' ' << y1 << ' ' << z1 << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) exe();
}
