#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  deque<int> arr(n);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int g = 0, s = 0, b = 0;
  int curr = arr.front();
  while (!arr.empty() && arr.front() == curr) {
    arr.pop_front();
    g++;
  }
  if (arr.empty() || g >= n / 2) {
    cout << "0 0 0\n";
    return;
  }
  curr = arr.front();
  while (!arr.empty() && arr.front() == curr) {
    s++;
    arr.pop_front();
  }
  if (arr.empty() || (g + s) >= n / 2) {
    cout << "0 0 0\n";
    return;
  }
  curr = arr.front();
  while (!arr.empty() && arr.front() == curr) {
    b++;
    arr.pop_front();
  }
  if ((g + s + b) > n / 2) {
    cout << "0 0 0 \n";
    return;
  }
  while (true) {
    curr = arr.front();
    int cnt = 0;
    while (!arr.empty() && arr.front() == curr) {
      ++cnt;
      arr.pop_front();
    }
    if ((g + s + b + cnt) <= n / 2) {
      b += cnt;
    } else {
      break;
    }
  }
  cout << g << " " << s << " " << b << "\n";
  return;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
