#include <bits/stdc++.h>
using namespace std;
function<void(void)> ____ = []() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
};
const int MAXN = 4e5 + 7;
int t, n, A[MAXN];
int main() {
  ____();
  cin >> t;
  A[0] = -1;
  while (t--) {
    cin >> n;
    vector<int> vec;
    cin >> A[1];
    for (int i = 2; i <= n; i++) {
      cin >> A[i];
      if (A[i] != A[i - 1]) vec.push_back(i - 1);
    }
    vec.push_back(n);
    while (!vec.empty() && vec.back() > n / 2) vec.pop_back();
    if (vec.size() < 3) {
      cout << "0 0 0" << endl;
      continue;
    }
    int pa = 0, pb = vec.size() - 2, pc = vec.size() - 1;
    while (vec[pc] - vec[pb] <= vec[pa] && pb > 1) pb--;
    if (vec[pc] - vec[pb] <= vec[pa] || vec[pb] - vec[pa] <= vec[pa]) {
      cout << "0 0 0" << endl;
      continue;
    }
    int ca = pa, cb = pb, cc = pc;
    while (true) {
      ca++;
      while (vec[cc] - vec[cb] <= vec[ca] && cb > ca + 1) cb--;
      if (vec[cc] - vec[cb] <= vec[ca] || vec[cb] - vec[ca] <= vec[ca])
        break;
      else
        pa = ca, pb = cb, pc = cc;
    }
    cout << vec[pa] << ' ' << vec[pb] - vec[pa] << ' ' << vec[pc] - vec[pb]
         << endl;
  }
  return 0;
}
