#include <bits/stdc++.h>
using namespace std;
void sep(string SS = "BLOCK") {
  cout << "-------------" << SS << "-----------------\n";
}
template <typename t>
void pr(t a) {
  cout << a << endl;
}
template <typename t>
void prs(t a) {
  cout << a << " ";
}
template <typename T>
void debugv(vector<T> arr) {
  for (auto t : arr) cout << t << " ";
  cout << "\n";
}
template <typename T>
void debugarr(T arr, int n) {
  for (int i = 0; i < n; i++) cout << arr[i] << " ";
  cout << "\n";
}
template <typename T>
void chmax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
void chmin(T& a, T b) {
  if (a > b) a = b;
}
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
const int maxn = 4e6 + 100;
const long long INF = 1e18;
long long a[maxn], n, m, t, k, q;
unordered_map<long long, long long> u;
string s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  while (t--) {
    cin >> n;
    for (long long i = 0; i < n; i++) cin >> a[i];
    long long l = 0, r = n - 1, res = l;
    long long g = 0, s = 0, b = 1;
    auto pos = [&](long long md) -> bool {
      g = 0, s = 0, b = 0;
      long long r = 0;
      long long gm = 0;
      while (r < n && a[r] == a[gm]) ++r, ++g;
      long long sm = r;
      while (r < n && g >= s) {
        sm = r;
        ++r, ++s;
      }
      while (r < n && a[r] == a[sm]) ++r, ++s;
      while (r < md) ++r, ++b;
      return g < s && g < b && (g + s + b) * 2 <= n;
    };
    long long rg = 0, rs = 0, rb = 0;
    while (l <= r) {
      long long md = l + ((r - l) >> 1);
      if (pos(md)) {
        rg = g, rs = s, rb = b;
        res = md;
        l = md + 1;
      } else
        r = md - 1;
    }
    prs(rg);
    prs(rs);
    pr(rb);
  }
}
