#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
double max(double a, double b) { return a > b ? a : b; }
double min(double a, double b) { return a < b ? a : b; }
long long modd(long long a) {
  if (a < 0LL) return a * -1LL;
  return a;
}
long double modd(long double a) {
  if (a < 0.0) return a * -1.0;
  return a;
}
long long modulo(long long a) { return a % 1000000007LL; }
long long power(long long k, long long p) {
  if (p == 0) return 1LL;
  long long P = power(k, p / 2LL);
  P = (P * P) % 1000000007LL;
  if (p % 2 == 1) P = (P * k) % 1000000007LL;
  return P;
}
struct p_str {
  long long a, b;
};
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<long long> v;
  long long i = 0;
  while (i < n) {
    long long c = 1;
    while (i + 1 < n && a[i] == a[i + 1]) {
      c++;
      i++;
    }
    v.push_back(c);
    i++;
  }
  long long k = v.size();
  long long h = n / 2;
  long long sum = 0;
  i = 0;
  while (i < k && sum + v[i] <= h) {
    sum += v[i];
    i++;
  }
  long long lim = i - 1;
  if (lim < 2) {
    cout << "0 0 0\n";
    return;
  }
  long long g = v[0];
  long long s = 0;
  i = 1;
  while (i <= lim && s <= g) {
    s += v[i++];
  }
  long long b = 0;
  while (i <= lim) {
    b += v[i++];
  }
  if (g >= b || g >= s || g == 0 || b == 0 || s == 0) {
    cout << "0 0 0\n";
    return;
  }
  cout << g << " " << s << " " << b << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
