#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e5;
int N, P[MAXN];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    cin >> N;
    for (int i = 0; i < N; ++i) cin >> P[i];
    int g = 0, s = 0, b = 0;
    int i = 0, j = 0;
    while (j < N && P[j] == P[i]) {
      ++g;
      ++j;
    }
    i = j;
    while (j < N && s < g) {
      ++s;
      ++j;
    }
    i = j;
    while (j < N && P[i] == P[j]) {
      ++s;
      ++j;
    }
    i = j;
    while (j < N && b < g) {
      ++b;
      ++j;
    }
    i = j;
    while (j < N && P[j] > P[N / 2]) {
      ++b;
      ++j;
    }
    i = j;
    if (g < s && g < b && s + b + g <= N / 2) {
      cout << g << ' ' << s << ' ' << b << '\n';
    } else
      cout << "0 0 0\n";
  }
  return 0;
}
