#include <bits/stdc++.h>
using namespace std;
void Debug() { cerr << '\n'; }
template <class FIRST, class... REST>
void Debug(FIRST arg, REST... rest) {
  cerr << arg << " ";
  Debug(rest...);
}
template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  if (!v.empty()) {
    for (int i = int(0); i < int((int)(v).size() - 1); i++) out << v[i] << ", ";
    out << v.back();
  }
  out << "]";
  return out;
}
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& v) {
  out << "(" << v.first << ", " << v.second << ")";
  return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const long long mod = 1000000007;
const int inf = (1 << 30) - 1;
const long long linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng;
int T;
int N;
int A[MAX_N];
void solve() {
  cin >> T;
  while (T--) {
    cin >> N;
    for (int i = int(0); i < int(N); i++) cin >> A[i];
    int at = -1;
    vector<int> vec;
    for (int i = int(0); i < int(N - 1); i++) {
      if (A[i] != A[i + 1] && i < N / 2) {
        vec.push_back(i);
        at = i;
      }
    }
    bool found = false;
    for (int i = int(0); i < int(at); i++) {
      if (A[i] == A[i + 1]) continue;
      int b = at - i;
      int gs = i + 1;
      if (gs <= 2) continue;
      auto it = lower_bound((vec).begin(), (vec).end(), (gs - 1) / 2);
      if (it == vec.begin()) continue;
      int g = *(--it) + 1;
      int s = gs - g;
      if (s <= b && !found) {
        found = true;
        cout << g << " " << s << " " << b << "\n";
      }
    }
    if (!found) {
      cout << 0 << " " << 0 << " " << 0 << "\n";
    }
  }
}
uint32_t rd() {
  uint32_t res;
  res = std::random_device()();
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(20);
  cerr << fixed;
  cerr.precision(6);
  rng.seed(rd());
  solve();
  cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  return 0;
}
