#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int add(int a, int b) {
  long long x = a + b;
  if (x >= 1000000007) x -= 1000000007;
  if (x < 0) x += 1000000007;
  return x;
}
long long mul(long long a, long long b) { return (a * b) % 1000000007; }
long long pw(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed() {
  long long a = rng();
  return a;
}
int t, n, v[500002], va[5];
int chk(int mid) {
  int pa = 1;
  while (pa <= mid && v[pa] == v[1]) ++pa;
  int gg = pa - 1;
  int npa = 2 * gg + 1;
  pa = npa;
  while (pa <= mid && v[npa] == v[pa]) ++pa;
  int ss = (pa - 1) - gg;
  npa = pa + gg;
  pa = npa;
  int bb = 0;
  while (pa <= mid) {
    while (v[npa] == v[pa]) ++pa;
    if ((pa - 1) <= mid) bb = (pa - 1) - (gg + ss);
    npa = pa;
  }
  if (gg >= ss || gg >= bb) return 0;
  if (gg + ss + bb > mid) return 0;
  va[1] = gg;
  va[2] = ss;
  va[3] = bb;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> t;
  for (; t; --t) {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> v[i];
    chk(n / 2);
    cout << va[1] << " " << va[2] << " " << va[3] << '\n';
    va[1] = va[2] = va[3] = 0;
  }
  return 0;
}
