#include <bits/stdc++.h>
using namespace std;
const long long N = 400007;
long long n, p[N];
void solve(vector<long long>& f) {
  long long sz = f.size();
  if (sz < 3) {
    cout << "0 0 0\n";
    return;
  }
  long long g = f[0];
  long long sm = 0, j = 1;
  while (j < sz && sm + f[j] < n / 2) {
    sm += f[j];
    j++;
  }
  long long sp = 0;
  for (long long i = 1; i < j; ++i) {
    sp += f[i];
    sm -= f[i];
    if (g < sp && g < sm) {
      cout << g << ' ' << sm << ' ' << sp << '\n';
      return;
    }
  }
  cout << "0 0 0\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    cin >> n;
    for (long long i = 0; i < n; ++i) {
      cin >> p[i];
    }
    vector<long long> f;
    long long cur = 1, i = 1;
    while (i < n) {
      if (p[i] == p[i - 1]) {
        cur++;
      } else {
        f.push_back(cur);
        cur = 1;
      }
      ++i;
    }
    f.push_back(cur);
    solve(f);
  }
  return 0;
}
