#include <bits/stdc++.h>
using namespace std;
int a[400005];
void solve() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  if (n == 1) {
    cout << "0 0 0" << endl;
    return;
  }
  int hf = n / 2;
  if (a[hf] == a[hf + 1]) {
    while (hf >= 1 and a[hf] == a[n / 2]) hf--;
  }
  int g = 0, s = 0, b = 0;
  int ind = 1;
  while (a[ind] == a[1] and ind <= hf) ind++;
  g = ind - 1;
  int cur = ind, f = 0;
  while (a[ind] <= a[cur] and ind <= hf) {
    if (ind - cur + 1 > g) {
      f = 1;
      break;
    }
    ind++;
  }
  if (f) {
    f = 0;
    while (a[ind] == a[ind - 1] and ind <= hf) f = 1, ind++;
    if (f)
      s = ind - cur;
    else
      s = ind - cur + 1, ind++;
  } else
    s = ind - cur;
  b = hf - ind + 1;
  if (g and s and b and (g < s) and (g < b)) {
    cout << g << ' ' << s << ' ' << b << endl;
  } else
    cout << "0 0 0" << endl;
}
int main() {
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
