#include <bits/stdc++.h>
using namespace std;
long long int mod(long long int base, long long int exp) {
  long long int res = 1;
  while (exp > 0) {
    if (exp & 1) res = (res * base) % 1000000007;
    base = (base * base) % 1000000007;
    exp = exp >> 1;
  }
  return res;
}
void solve() {
  long int n, a[40010], i, mid, g = 0, s = 0, b = 0, c = 0;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  mid = (n - 1) / 2;
  if (a[mid] == a[(n - 1) / 2 + 1]) {
    while (a[mid] == a[(n - 2) / 2 + 1]) mid--;
  }
  i = 0;
  while (a[i] == a[i + 1] && i <= mid) i++;
  g = i + 1;
  i += 2;
  while (a[i] == a[i + 1] && i <= mid) i++;
  s = (i + 1) - g;
  i++;
  while (a[i] >= a[i + 1] && i + 1 <= mid) i++;
  b = (i + 1) - (g + s);
  if ((g + s + b) <= n / 2 && b > g)
    cout << g << " " << s << " " << b << endl;
  else
    cout << "0 0 0" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
