#include <bits/stdc++.h>
using namespace std;
long long q, n, f[400002], a[400002], i, g, b, s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> q;
  while (q--) {
    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i];
    f[n + 1] = 0;
    for (i = n; i >= 1; i--)
      if (a[i] == a[i + 1])
        f[i] = f[i + 1] + 1;
      else
        f[i] = 1;
    g = s = b = 0;
    i = 1;
    g += f[i];
    i += f[i];
    while (i <= n && s <= g) {
      s += f[i];
      i += f[i];
    }
    if (g + s > n / 2) {
      cout << 0 << " " << 0 << " " << 0 << '\n';
      continue;
    }
    while (i <= n && g + s + b + f[i] <= n / 2) {
      b += f[i];
      i += f[i];
    }
    if (g > min(b, s) || g + b + s > n / 2)
      cout << 0 << " " << 0 << " " << 0 << '\n';
    else
      cout << g << " " << s << " " << b << '\n';
  }
}
