#include <bits/stdc++.h>
using namespace std;
void ritikio();
const long long int inff = LLONG_MAX;
const long long int minff = LLONG_MIN;
const long long int inf = 1e18;
const long long int pmod = 998244353;
const long long int mod = 1e9 + 7;
const long long int maxm = 2e6 + 3;
const long long int maxN = 1e5 + 3;
void solve() {
  long long int n;
  cin >> n;
  long long int mx = n / 2;
  if (n % 2 == 1) mx--;
  long long int prev;
  cin >> prev;
  vector<long long int> v;
  long long int cnt = 1;
  for (long long int i = 0; i < n - 1; i++) {
    long long int x;
    cin >> x;
    if (x == prev)
      cnt++;
    else {
      v.push_back(cnt);
      cnt = 1;
      prev = x;
    }
  }
  v.push_back(cnt);
  long long int z = (long long int)v.size();
  if (mx < 5 || z < 3) {
    cout << 0 << " " << 0 << " " << 0 << endl;
    return;
  }
  long long int g = 0, s = 0, b = 0;
  g = v[0];
  long long int r = 1;
  while (r < z && s <= g && ((g + s + b) + v[r]) <= mx) s += v[r], r++;
  while (r < z && b <= g && ((g + s + b) + v[r]) <= mx) b += v[r], r++;
  while (r < z && ((g + s + b) + v[r]) <= mx) b += v[r], r++;
  if (g < s && g < b && s > 0 && b > 0 && (g + s + b) <= mx) {
    cout << g << " " << s << " " << b << endl;
  } else {
    cout << 0 << " " << 0 << " " << 0 << endl;
  }
}
signed main() {
  ritikio();
  long long int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
}
void ritikio() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
