#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
void inp(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
void solve() {
  long long n, g = 1;
  cin >> n;
  long long a[n];
  inp(a, n);
  vector<long long> v;
  for (long long i = 1; i < n; i++) {
    if (a[i] == a[i - 1])
      g++;
    else {
      v.push_back(g);
      g = 1;
    }
  }
  v.push_back(g);
  long long s = 0, p;
  for (long long i = 0; i < (long long)((v).size()); i++) {
    s += v[i];
    if (s > n / 2) {
      p = i - 1;
      break;
    }
  }
  if (p < 2) {
    cout << "0 0 0" << '\n';
    return;
  }
  long long sum = 0;
  for (long long i = 0; i < p + 1; i++) sum += v[i];
  long long a1 = v[0], a2 = 0, a3 = 0;
  for (long long i = 1; i < p + 1; i++) {
    a2 += v[i];
    if (a2 > a1) {
      for (long long j = i + 1; j < p + 1; j++) {
        a3 += v[j];
        if (a3 > a1) {
          cout << a1 << " " << a2 << " " << sum - a1 - a2 << '\n';
          return;
        }
      }
    }
  }
  cout << "0 0 0" << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) solve();
}
