#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec) is >> v;
  return is;
}
template <typename T>
void dout(string name, T arg) {
  cerr << arg << endl;
}
template <typename T1, typename... T2>
void dout(string names, T1 arg, T2... args) {
  cerr << arg << " | ";
  dout(names.substr(names.find(',') + 2), args...);
}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int mx = 1e6 + 5;
const int INF = 1000000007;
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y >>= 1;
    x = (x * x) % 1000000007;
  }
  return (res % 1000000007);
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> arr(n);
  cin >> arr;
  long long can = n / 2;
  long long g = 0, s = 0, b = 0;
  long long i = n / 2 - 1;
  while (i >= 0 && arr[i] == arr[i + 1]) i--;
  while (i - 1 >= 0 && arr[i] == arr[i - 1]) {
    i--;
    b++;
  }
  i--;
  b++;
  long long j = 0;
  while (j < n / 2 && arr[j] == arr[j + 1]) {
    j++, g++;
  }
  j++;
  g++;
  if (g >= b) {
    while (i - 1 >= 0 && arr[i] == arr[i - 1]) {
      i--;
      b++;
    }
    i--;
    b++;
  }
  if (j < i && i - j + 1 > 0) {
    s = i - j + 1;
    cout << g << ' ' << s << ' ' << b << '\n';
  } else
    cout << "0 0 0\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
