#include <bits/stdc++.h>
using namespace std;
long long expo(long long x, long long n, long long m) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return expo((x * x) % m, n / 2, m);
  else
    return (x * expo((x * x) % m, (n - 1) / 2, m)) % m;
}
string DtoB(int j) {
  string s = "";
  for (int i = 32; i >= 0; i--) {
    int k = j >> i;
    if (k & 1)
      s += "1";
    else
      s += "0";
  }
  return s;
}
void solve() {
  int n;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (n <= 7) {
    cout << "0 0 0" << endl;
    return;
  }
  int last = n / 2 - 1;
  int g = 0, s = 0, b = 0;
  for (int i = 0; i <= last; i++)
    if (arr[i] == arr[i + 1])
      g++;
    else
      break;
  g++;
  for (int i = g; i <= last; i++) {
    if (g >= s || arr[i] == arr[i + 1] || g == s) {
      s++;
      continue;
    } else
      break;
  }
  b = n / 2 - g - s;
  if (g <= 0 || s <= 0 || b <= 0 || g >= s || g >= b)
    cout << "0 0 0" << endl;
  else
    cout << g << " " << s << " " << b << endl;
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
