#include <bits/stdc++.h>
using namespace std;
int cnt(vector<int>& a, int& i) {
  int curr = a[i];
  int ret = 0;
  while (i < a.size() && a[i] == curr) {
    ++ret;
    ++i;
  }
  return ret;
}
int f() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int& i : a) cin >> i;
  vector<int> ret(3, 0);
  int i = 0;
  ret[0] += cnt(a, i);
  if (i > n / 2) return -1;
  while (i < n / 2 && ret[1] <= ret[0]) {
    int t = cnt(a, i);
    if (i <= n / 2) {
      ret[1] += t;
    }
  }
  if (ret[1] <= ret[0]) return -1;
  while (i < n / 2) {
    int t = cnt(a, i);
    if (i <= n / 2) {
      ret[2] += t;
    }
  }
  if (ret[2] <= ret[0]) return -1;
  for (int i : ret) {
    cout << i << " ";
  }
  cout << '\n';
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T;
  cin >> T;
  while (T--) {
    if (f()) {
      cout << "0 0 0\n";
    }
  }
  return 0;
}
