#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
void DEBUG(string label, T value) {
  cerr << "[" << label << " = " << value << "]\n";
}
void solve() {
  int n;
  cin >> n;
  vector<int> arr(n);
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  int mid = n / 2 - 1;
  if (mid <= 2) {
    cout << "0 0 0" << endl;
    return;
  }
  int up = mid;
  while (up >= 0 && arr[mid + 1] == arr[up]) {
    up--;
  }
  int j = 1;
  while (j <= up && arr[j] == arr[0]) {
    j++;
  }
  if (j == up + 1) {
    cout << "0 0 0" << endl;
    return;
  }
  int gold = j;
  int i = j;
  int silver = 0;
  while (i <= up) {
    j = i + 1;
    while (j <= up && arr[j] == arr[i]) {
      j++;
    }
    int cnt = j - i;
    silver += cnt;
    i = j;
    if (silver > gold) break;
  }
  if (silver <= gold || i == up + 1) {
    cout << "0 0 0" << endl;
    return;
  }
  cout << gold << " " << silver << " " << up - i + 1 << endl;
}
int main(int argv, char **argc) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
