#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> run_length(const vector<int>& v) {
  vector<int> res;
  int now = v[0];
  int cnt = 1;
  for (int i = (int)1; i < (int)v.size(); ++i) {
    if (now == v[i])
      ++cnt;
    else {
      res.push_back(cnt);
      now = v[i];
      cnt = 1;
    }
  }
  res.push_back(cnt);
  return res;
}
void solve() {
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = (int)0; i < (int)N; ++i) cin >> P[i];
  vector<int> p = run_length(P);
  if (p.size() < 3) {
    cout << "0 0 0" << endl;
    return;
  }
  int g = p[0];
  int s = 0;
  int pos = 1;
  while (pos < p.size() && s <= g) {
    s += p[pos++];
  }
  if (s < g) {
    cout << "0 0 0" << endl;
    return;
  }
  int b = 0;
  while (pos < p.size()) {
    if ((g + s + b + p[pos]) * 2 <= N) {
      b += p[pos++];
    } else
      break;
  }
  if (b <= g) {
    cout << "0 0 0" << endl;
    return;
  }
  cout << g << ' ' << s << ' ' << b << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int T;
  cin >> T;
  for (int i = (int)0; i < (int)T; ++i) solve();
  return 0;
}
